Adrian Bondy / Jean Fonlupt / Jean-Luc Fouquet / Jean-Claude Fournier / Jorge L. Ramírez Alfonsín (eds.)

Graph Theory in Paris

Proceedings of a Conference in Memory of Claude Berge
Ed. by Adrian J. Bondy, Jean Fonlipt, Jean-Luc Fouquet et al.

• Gebundenes Buch

Produktbeschreibung

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.

Produktdetails

• Trends in Mathematics
• Verlag: Birkhäuser Basel / Springer, Basel
• Artikelnr. des Verlages: 11367383
• 2007
• Seitenzahl: 400
• Erscheinungstermin: 23. Oktober 2006
• Englisch
• Abmessung: 250mm x 175mm x 27mm
• Gewicht: 872g
• ISBN-13: 9783764372286
• ISBN-10: 3764372281
• Artikelnr.: 14733773

Autorenporträt

Adrian Bondy, Université Paris VI, France / Jean Fonlupt, Université Paris VI, France / Jean-Luc Fouquet, IUT du Mans, Le Mans, France / Jean-Claude Fournier, Université Paris VI, France / Jorge L. Ramirez Alfonsin, Université Paris VI, France

Inhaltsangabe

Claude Berge Sculptor of Graph Theory.- ?-path-connectivity and mk-generation: an Upper Bound on m.- Automated Results and Conjectures on Average Distance in Graphs.- Brambles, Prisms and Grids.- Dead Cell Analysis in Hex and the Shannon Game.- Ratios of Some Domination Parameters in Graphs and Claw-free Graphs.- Excessive Factorizations of Regular Graphs.- Odd Pairs of Cliques.- Recognition of Perfect Circular-arc Graphs.- On Edge-maps whose Inverse Preserves Flows or Tensions.- On the Extremal Number of Edges in 2-Factor Hamiltonian Graphs.- Generalized Colourings (Matrix Partitions) of Cographs.- A Note on [k, l]-sparse Graphs.- Even Pairs in Bull-reducible Graphs.- Kernels in Orientations of Pretransitive Orientable Graphs.- Nonrepetitive Graph Coloring.- A Characterization of the 1-well-covered Graphs with no 4-cycles.- A Graph-theoretical Generalization of Berge s Analogue of the Erd?s-Ko-Rado Theorem.- Independence Polynomials and the Unimodality Conjecture for Very Well-covered, Quasi-regularizable, and Perfect Graphs.- Precoloring Extension on Chordal Graphs.- On the Enumeration of Bipartite Minimum Edge Colorings.- Kempe Equivalence of Colorings.- Acyclic 4-choosability of Planar Graphs with Girth at Least 5.- Automorphism Groups of Circulant Graphs a Survey.- Hypo-matchings in Directed Graphs.- On Reed s Conjecture about ?,? and ?.- On the Generalization of the Matroid Parity Problem.- Reconstruction of a Rank 3 Oriented Matroids from its Rank 2 Signed Circuits.- The Normal Graph Conjecture is True for Circulants.- Two-arc Transitive Near-polygonal Graphs.- Open Problems.

---

Claude Berge — Sculptor of Graph Theory.- ?-path-connectivity and mk-generation: an Upper Bound on m.- Automated Results and Conjectures on Average Distance in Graphs.- Brambles, Prisms and Grids.- Dead Cell Analysis in Hex and the Shannon Game.- Ratios of Some Domination Parameters in Graphs and Claw-free Graphs.- Excessive Factorizations of Regular Graphs.- Odd Pairs of Cliques.- Recognition of Perfect Circular-arc Graphs.- On Edge-maps whose Inverse Preserves Flows or Tensions.- On the Extremal Number of Edges in 2-Factor Hamiltonian Graphs.- Generalized Colourings (Matrix Partitions) of Cographs.- A Note on [k, l]-sparse Graphs.- Even Pairs in Bull-reducible Graphs.- Kernels in Orientations of Pretransitive Orientable Graphs.- Nonrepetitive Graph Coloring.- A Characterization of the 1-well-covered Graphs with no 4-cycles.- A Graph-theoretical Generalization of Berge’s Analogue of the Erd?s-Ko-Rado Theorem.- Independence Polynomials and the Unimodality Conjecture for Very Well-covered, Quasi-regularizable, and Perfect Graphs.- Precoloring Extension on Chordal Graphs.- On the Enumeration of Bipartite Minimum Edge Colorings.- Kempe Equivalence of Colorings.- Acyclic 4-choosability of Planar Graphs with Girth at Least 5.- Automorphism Groups of Circulant Graphs — a Survey.- Hypo-matchings in Directed Graphs.- On Reed’s Conjecture about ?,? and ?.- On the Generalization of the Matroid Parity Problem.- Reconstruction of a Rank 3 Oriented Matroids from its Rank 2 Signed Circuits.- The Normal Graph Conjecture is True for Circulants.- Two-arc Transitive Near-polygonal Graphs.- Open Problems.