Graph Theory in Paris : Proceedings of a Conference in Memory of Claude Berge : GT04, Paris
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 volu...
Na minha lista:
| Autor principal: | |
|---|---|
| Autor Corporativo: | |
| Outros Autores: | , , , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Basel :
Birkhäuser Basel
[20..].
Cham : Springer Nature |
| Edição: | 1st ed. 2007. |
| Colecção: | Trends in Mathematics
|
| Assuntos: | |
| Acesso em linha: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
L'impression du document génère 386 p. Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Variante du titre: | Mélanges :, Berge |
| Edition sous un autre format: | • Graph Theory in Paris, Texte imprimé, 9783764390617 • Graph theory in Paris, proceedings of a conference in memory of Claude Berge, GT04, Paris, Adrian Bondy, Jean Fonlupt, Jean-Luc Fouquet... [et al.], editors, Basel, Birkhäuser, 2007, 1 vol. (VI-389 p.), Trends in mathematics, 3-7643-7228-1 |
Sumário:
- 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