Ebook: Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge
- Tags: Order Lattices Ordered Algebraic Structures, Convex and Discrete Geometry, Operations Research Mathematical Programming
- Series: Trends in Mathematics
- Year: 2007
- Publisher: Birkhäuser Basel
- Edition: 1
- Language: English
- pdf
In July 2004, a conference on graph theory was held in Paris in memory of Claude Berge, one of the pioneers of the field. The event brought together many prominent specialists on topics, such as perfect graphs and matching theory, upon which Claude Berge's work has had a major impact.
This volume includes contributions to these and other topics from many of the participants.
In July 2004, a conference on graph theory was held in Paris in memory of Claude Berge, one of the pioneers of the field. The event brought together many prominent specialists on topics, such as perfect graphs and matching theory, upon which Claude Berge's work has had a major impact.
This volume includes contributions to these and other topics from many of the participants.
In July 2004, a conference on graph theory was held in Paris in memory of Claude Berge, one of the pioneers of the field. The event brought together many prominent specialists on topics, such as perfect graphs and matching theory, upon which Claude Berge's work has had a major impact.
This volume includes contributions to these and other topics from many of the participants.
Content:
Front Matter....Pages i-viii
Claude Berge — Sculptor of Graph Theory....Pages 1-9
Automated Results and Conjectures on Average Distance in Graphs....Pages 11-19
Brambles, Prisms and Grids....Pages 21-36
Dead Cell Analysis in Hex and the Shannon Game....Pages 37-44
Ratios of Some Domination Parameters in Graphs and Claw-free Graphs....Pages 45-59
Excessive Factorizations of Regular Graphs....Pages 61-72
Odd Pairs of Cliques....Pages 73-84
Recognition of Perfect Circular-arc Graphs....Pages 85-95
On Edge-maps whose Inverse Preserves Flows or Tensions....Pages 97-108
On the Extremal Number of Edges in 2-Factor Hamiltonian Graphs....Pages 109-138
Generalized Colourings (Matrix Partitions) of Cographs....Pages 139-148
A Note on [k, l]-sparse Graphs....Pages 149-167
Even Pairs in Bull-reducible Graphs....Pages 169-177
Kernels in Orientations of Pretransitive Orientable Graphs....Pages 179-195
Nonrepetitive Graph Coloring....Pages 197-208
A Characterization of the 1-well-covered Graphs with no 4-cycles....Pages 209-218
A Graph-theoretical Generalization of Berge’s Analogue of the Erd?s-Ko-Rado Theorem....Pages 219-224
Independence Polynomials and the Unimodality Conjecture for Very Well-covered, Quasi-regularizable, and Perfect Graphs....Pages 225-242
Precoloring Extension on Chordal Graphs....Pages 243-254
On the Enumeration of Bipartite Minimum Edge Colorings....Pages 255-270
Kempe Equivalence of Colorings....Pages 271-285
Acyclic 4-choosability of Planar Graphs with Girth at Least 5....Pages 287-297
Automorphism Groups of Circulant Graphs — a Survey....Pages 299-310
Hypo-matchings in Directed Graphs....Pages 311-325
On the Generalization of the Matroid Parity Problem....Pages 327-337
Reconstruction of a Rank 3 Oriented Matroids from its Rank 2 Signed Circuits....Pages 339-346
The Normal Graph Conjecture is True for Circulants....Pages 347-354
Two-arc Transitive Near-polygonal Graphs....Pages 355-364
Open Problems....Pages 365-374
....Pages 375-380