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.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Otros Autores: Berge, Claude, Chv�atal, Va�sek, 1946-
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

MARC

LEADER 00000cam a2200000 a 4500
001 SCIDIR_ocn316569754
003 OCoLC
005 20231117015255.0
006 m o d
007 cr cn|||||||||
008 090320s1984 ne a ob 000 0 eng d
040 |a OPELS  |b eng  |e pn  |c OPELS  |d OPELS  |d OCLCQ  |d OCLCF  |d OCLCO  |d DEBBG  |d N$T  |d IDEBK  |d E7B  |d UA@  |d YDXCP  |d OCLCQ  |d DEBSZ  |d OCLCQ  |d LEAUB  |d VLY  |d OCLCO  |d OCLCQ  |d OCLCO 
019 |a 302283414  |a 646773832  |a 742293057  |a 815691176  |a 823118306  |a 823838969  |a 823907342  |a 824096642  |a 824149427  |a 1162057544 
020 |a 9780444865878 
020 |a 044486587X 
020 |a 9780080871998  |q (electronic bk.) 
020 |a 0080871992  |q (electronic bk.) 
020 |a 1281790214 
020 |a 9781281790217 
020 |a 9786611790219 
020 |a 6611790217 
035 |a (OCoLC)316569754  |z (OCoLC)302283414  |z (OCoLC)646773832  |z (OCoLC)742293057  |z (OCoLC)815691176  |z (OCoLC)823118306  |z (OCoLC)823838969  |z (OCoLC)823907342  |z (OCoLC)824096642  |z (OCoLC)824149427  |z (OCoLC)1162057544 
050 4 |a QA166.16  |b .T66 1984eb 
072 7 |a MAT  |x 013000  |2 bisacsh 
072 7 |a PBD  |2 bicssc 
082 0 4 |a 511/.5  |2 22 
245 0 0 |a Topics on perfect graphs /  |c edited by C. Berge, V. Chv�atal. 
260 |a Amsterdam ;  |a New York :  |b North-Holland Pub. Co. ;  |a New York :  |b Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,  |c 1984. 
300 |a 1 online resource (xiv, 369 pages) :  |b illustrations 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a North-Holland mathematics studies ;  |v 88 
490 1 |a Annals of discrete mathematics ;  |v 21 
520 |a 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. 
504 |a Includes bibliographical references. 
588 0 |a Print version record. 
505 0 |a 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 
505 8 |a 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 
505 8 |a 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 
505 8 |a 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 
546 |a English. 
650 0 |a Perfect graphs. 
650 6 |a Graphes parfaits.  |0 (CaQQLa)201-0385426 
650 7 |a MATHEMATICS  |x Graphic Methods.  |2 bisacsh 
650 7 |a Perfect graphs  |2 fast  |0 (OCoLC)fst01057796 
653 |a Perfect graphs 
700 1 |a Berge, Claude. 
700 1 |a Chv�atal, Va�sek,  |d 1946- 
776 0 8 |i Print version:  |t Topics on perfect graphs.  |d Amsterdam ; New York : North-Holland Pub. Co. ; New York : Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1984  |z 044486587X  |z 9780444865878  |w (DLC) 83002353  |w (OCoLC)9281935 
830 0 |a North-Holland mathematics studies ;  |v 88. 
830 0 |a Annals of discrete mathematics ;  |v 21. 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/book/9780444865878  |z Texto completo 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/publication?issn=03040208&volume=88  |z Texto completo 
856 4 0 |u https://sciencedirect.uam.elogim.com/science/bookseries/03040208/88  |z Texto completo