Cargando…
Topics on perfect graphs /
The purpose of this book is to present selected results on perfect graphs in a single volume. These take the form of reprinted classical papers, survey papers or new results.
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York : New York :
North-Holland Pub. Co. ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
1984.
|
| Colección: | North-Holland mathematics studies ;
88. Annals of discrete mathematics ; 21. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
Tabla de Contenidos:
- Front Cover; Topics on Perfect Graphs; Copyright Page; Contents; Introduction; Part I: General results; Chapter 1. Minimax theorems for normal hypergraphs and balanced hypergraphs
- A survey; Chapter 2. A class of bichromatic hypergraphs; Chapter 3. Normal hypergraphs and the Weak Perfect Graph Conjecture; Part II: Special classes of perfect graphs; Chapter 4. Diperfect graphs; Chapter 5. Strongly perfect graphs; Chapter 6. Perfectly ordered graphs; Chapter 7. Classical perfect graphs; Chapter 8. The Perfect Graph Conjecture for toroidal graphs
- Chapter 9. The Perfect Graph Conjecture on special graphs
- A surveyChapter 10. The graphs whose odd cycles have at least two chords; Chapter 11. Contributions to a characterization of the structure of perfect graphs; Chapter 12. Meyniel's graphs are strongly perfect; Chapter 13. The validity of the Perfect Graph Conjecture for K4-free graphs; Part III: Polyhedral point of view; Chapter 14. The Strong Perfect Graph Theorem for a class of partitionable graphs; Chapter 15. A characterization of perfect matrices; Part IV: Which graphs are imperfect
- Chapter 16. Graphical properties related to minimal imperfectionChapter 17. An equivalent version of the Strong Perfect Graph Conjecture; Chapter 18. Combinatorial designs related to the Perfect Graph Conjecture; Chapter 19. A classification of certain graphs with minima limperfection properties; Part V: Which graphs are perfect; Chapter 20. A composition for perfect graphs; Chapter 21. Polynomial algorithm to recognize a Meyniel graph; Chapter 22. Parity graphs; Chapter 23. A semi-strong Perfect Graph Conjecture
- Chapter 24. A method for solving certain graph recognition and optimization problems, with applications to perfect graphsPart VI: Optimization in perfect graphs; Chapter 25. Algorithmic aspects of perfect graphs; Chapter 26. Polynomial algorithms for perfect graphs; Chapter 27. Algorithms for maximum weight cliques, minimum weighted clique covers and minimum colorings of claw-free perfect graphs