Graph theory in Paris: proceedings of a conference in memory of Claude Berge : GT04, Paris

Front Matter....Pages i-viii
Claude Berge — Sculptor of Graph Theory....Pages 1-9
 κ -path-connectivity and mk -generation: an Upper Bound on m ....Pages 11-19
Automated Results and Conjectures on Average Distance in Graphs....Pages 21-36
Brambles, Prisms and Grids....Pages 37-44
Dead Cell Analysis in Hex and the Shannon Game....Pages 45-59
Ratios of Some Domination Parameters in Graphs and Claw-free Graphs....Pages 61-72
Excessive Factorizations of Regular Graphs....Pages 73-84
Odd Pairs of Cliques....Pages 85-95
Recognition of Perfect Circular-arc Graphs....Pages 97-108
On Edge-maps whose Inverse Preserves Flows or Tensions....Pages 109-138
On the Extremal Number of Edges in 2-Factor Hamiltonian Graphs....Pages 139-148
Generalized Colourings (Matrix Partitions) of Cographs....Pages 149-167
A Note on [ k, l ]-sparse Graphs....Pages 169-177
Even Pairs in Bull-reducible Graphs....Pages 179-195
Kernels in Orientations of Pretransitive Orientable Graphs....Pages 197-208
Nonrepetitive Graph Coloring....Pages 209-218
A Characterization of the 1-well-covered Graphs with no 4-cycles....Pages 219-224
A Graph-theoretical Generalization of Berge’s Analogue of the Erdős-Ko-Rado Theorem....Pages 225-242
Independence Polynomials and the Unimodality Conjecture for Very Well-covered, Quasi-regularizable, and Perfect Graphs....Pages 243-254
Precoloring Extension on Chordal Graphs....Pages 255-270
On the Enumeration of Bipartite Minimum Edge Colorings....Pages 271-285
Kempe Equivalence of Colorings....Pages 287-297
Acyclic 4-choosability of Planar Graphs with Girth at Least 5....Pages 299-310
Automorphism Groups of Circulant Graphs — a Survey....Pages 311-325
Hypo-matchings in Directed Graphs....Pages 327-337
On Reed’s Conjecture about ω ,Δ and χ ....Pages 339-346
On the Generalization of the Matroid Parity Problem....Pages 347-354
Reconstruction of a Rank 3 Oriented Matroids from its Rank 2 Signed Circuits....Pages 355-364
The Normal Graph Conjecture is True for Circulants....Pages 365-374
Two-arc Transitive Near-polygonal Graphs....Pages 375-380
Open Problems....Pages 381-389