↓ Skip to main content
Altmetric
What is this page?
Embed badge
Share
Share on Twitter
Share on Facebook
Share by email
Graph Theory in Paris : Proceedings of a Conference in Memory of Claude Berge
Overview of attention for book
Table of Contents
Altmetric Badge
Book Overview
Altmetric Badge
Chapter 1
Claude Berge — Sculptor of Graph Theory
Altmetric Badge
Chapter 2
κ -path-connectivity and mk -generation: an Upper Bound on m
Altmetric Badge
Chapter 3
Automated Results and Conjectures on Average Distance in Graphs
Altmetric Badge
Chapter 4
Brambles, Prisms and Grids
Altmetric Badge
Chapter 5
Dead Cell Analysis in Hex and the Shannon Game
Altmetric Badge
Chapter 6
Ratios of Some Domination Parameters in Graphs and Claw-free Graphs
Altmetric Badge
Chapter 7
Excessive Factorizations of Regular Graphs
Altmetric Badge
Chapter 8
Odd Pairs of Cliques
Altmetric Badge
Chapter 9
Recognition of Perfect Circular-arc Graphs
Altmetric Badge
Chapter 10
On Edge-maps whose Inverse Preserves Flows or Tensions
Altmetric Badge
Chapter 11
On the Extremal Number of Edges in 2-Factor Hamiltonian Graphs
Altmetric Badge
Chapter 12
Generalized Colourings (Matrix Partitions) of Cographs
Altmetric Badge
Chapter 13
A Note on [ k, l ]-sparse Graphs
Altmetric Badge
Chapter 14
Even Pairs in Bull-reducible Graphs
Altmetric Badge
Chapter 15
Kernels in Orientations of Pretransitive Orientable Graphs
Altmetric Badge
Chapter 16
Nonrepetitive Graph Coloring
Altmetric Badge
Chapter 17
A Characterization of the 1-well-covered Graphs with no 4-cycles
Altmetric Badge
Chapter 18
A Graph-theoretical Generalization of Berge’s Analogue of the Erdős-Ko-Rado Theorem
Altmetric Badge
Chapter 19
Independence Polynomials and the Unimodality Conjecture for Very Well-covered, Quasi-regularizable, and Perfect Graphs
Altmetric Badge
Chapter 20
Precoloring Extension on Chordal Graphs
Altmetric Badge
Chapter 21
On the Enumeration of Bipartite Minimum Edge Colorings
Altmetric Badge
Chapter 22
Kempe Equivalence of Colorings
Altmetric Badge
Chapter 23
Acyclic 4-choosability of Planar Graphs with Girth at Least 5
Altmetric Badge
Chapter 24
Automorphism Groups of Circulant Graphs — a Survey
Altmetric Badge
Chapter 25
Hypo-matchings in Directed Graphs
Altmetric Badge
Chapter 26
On Reed’s Conjecture about ω ,Δ and χ
Altmetric Badge
Chapter 27
On the Generalization of the Matroid Parity Problem
Altmetric Badge
Chapter 28
Reconstruction of a Rank 3 Oriented Matroids from its Rank 2 Signed Circuits
Altmetric Badge
Chapter 29
The Normal Graph Conjecture is True for Circulants
Altmetric Badge
Chapter 30
Two-arc Transitive Near-polygonal Graphs
Altmetric Badge
Chapter 31
Open Problems
Overall attention for this book and its chapters
Altmetric Badge
Mentioned by
twitter
3
X users
syllabi
1
institution with syllabi
wikipedia
6
Wikipedia pages
Citations
dimensions_citation
25
Dimensions
Readers on
mendeley
5
Mendeley
Book overview
1. Claude Berge — Sculptor of Graph Theory
2. κ -path-connectivity and mk -generation: an Upper Bound on m
3. Automated Results and Conjectures on Average Distance in Graphs
4. Brambles, Prisms and Grids
5. Dead Cell Analysis in Hex and the Shannon Game
6. Ratios of Some Domination Parameters in Graphs and Claw-free Graphs
7. Excessive Factorizations of Regular Graphs
8. Odd Pairs of Cliques
9. Recognition of Perfect Circular-arc Graphs
10. On Edge-maps whose Inverse Preserves Flows or Tensions
11. On the Extremal Number of Edges in 2-Factor Hamiltonian Graphs
12. Generalized Colourings (Matrix Partitions) of Cographs
13. A Note on [ k, l ]-sparse Graphs
14. Even Pairs in Bull-reducible Graphs
15. Kernels in Orientations of Pretransitive Orientable Graphs
16. Nonrepetitive Graph Coloring
17. A Characterization of the 1-well-covered Graphs with no 4-cycles
18. A Graph-theoretical Generalization of Berge’s Analogue of the Erdős-Ko-Rado Theorem
19. Independence Polynomials and the Unimodality Conjecture for Very Well-covered, Quasi-regularizable, and Perfect Graphs
20. Precoloring Extension on Chordal Graphs
21. On the Enumeration of Bipartite Minimum Edge Colorings
22. Kempe Equivalence of Colorings
23. Acyclic 4-choosability of Planar Graphs with Girth at Least 5
24. Automorphism Groups of Circulant Graphs — a Survey
25. Hypo-matchings in Directed Graphs
26. On Reed’s Conjecture about ω ,Δ and χ
27. On the Generalization of the Matroid Parity Problem
28. Reconstruction of a Rank 3 Oriented Matroids from its Rank 2 Signed Circuits
29. The Normal Graph Conjecture is True for Circulants
30. Two-arc Transitive Near-polygonal Graphs
31. Open Problems
Summary
X
Syllabi
Wikipedia
Dimensions citations
This data is correct as of December 2015 - for more up to date information, please visit
https://opensyllabus.org/
So far, Altmetric has seen this research output assigned in
1
syllabus from an institution on Open Syllabus Project.
Institution
Syllabi count
Course subject areas covered
Unknown
1
Unknown