Graph classes: a survey
This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors s...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Philadelphia, Pa.
Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)
1999
|
| Schriftenreihe: | SIAM monographs on discrete mathematics and applications
3 |
| Schlagworte: | |
| Online-Zugang: | TUM01 UBW01 UBY01 UER01 Volltext |
| Zusammenfassung: | This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided to make the book useful to a variety of readers |
| Beschreibung: | Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (p. 251-292) and index Preface -- 1. Basic concepts -- 2. Perfection, generalized perfection, and related concepts -- 3. Cycles, chords and bridges -- 4. Models and interactions -- 5. Vertex and edge orderings -- 6. Posets -- 7. Forbidden subgraphs -- 8. Hypergraphs and graphs -- 9. Matrices and polyhedra -- 10. Distance properties -- 11. Algebraic compositions and recursive definitions -- 12. Decompositions and cutsets -- 13. Threshold graphs and related concepts -- 14. The strong perfect graph conjecture -- Appendix A. Recognition -- Appendix B. Containment relationships -- Bibliography -- Index |
| Beschreibung: | 1 Online-Ressource (XI, 304 Seiten) |
| ISBN: | 9780898719796 |
| DOI: | 10.1137/1.9780898719796 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV040289498 | ||
| 003 | DE-604 | ||
| 005 | 20210408 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 120703s1999 |||| o||u| ||||||eng d | ||
| 020 | |a 9780898719796 |9 978-0-89871-979-6 | ||
| 024 | 7 | |a 10.1137/1.9780898719796 |2 doi | |
| 035 | |a (OCoLC)816193143 | ||
| 035 | |a (DE-599)BVBBV040289498 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29 |a DE-91 |a DE-706 |a DE-83 |a DE-20 | ||
| 100 | 1 | |a Brandstädt, Andreas |d 1949- |0 (DE-588)133631737 |4 aut | |
| 245 | 1 | 0 | |a Graph classes |b a survey |c Andreas Brandstädt, Van Bang Le, Jeremy P. Spinrad |
| 264 | 1 | |a Philadelphia, Pa. |b Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |c 1999 | |
| 300 | |a 1 Online-Ressource (XI, 304 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a SIAM monographs on discrete mathematics and applications |v 3 | |
| 500 | |a Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader | ||
| 500 | |a Includes bibliographical references (p. 251-292) and index | ||
| 500 | |a Preface -- 1. Basic concepts -- 2. Perfection, generalized perfection, and related concepts -- 3. Cycles, chords and bridges -- 4. Models and interactions -- 5. Vertex and edge orderings -- 6. Posets -- 7. Forbidden subgraphs -- 8. Hypergraphs and graphs -- 9. Matrices and polyhedra -- 10. Distance properties -- 11. Algebraic compositions and recursive definitions -- 12. Decompositions and cutsets -- 13. Threshold graphs and related concepts -- 14. The strong perfect graph conjecture -- Appendix A. Recognition -- Appendix B. Containment relationships -- Bibliography -- Index | ||
| 520 | |a This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided to make the book useful to a variety of readers | ||
| 650 | 4 | |a Graph theory | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Le, Van Bang |d 1959- |0 (DE-588)121863980 |4 aut | |
| 700 | 1 | |a Spinrad, Jeremy P. |4 aut | |
| 830 | 0 | |a SIAM monographs on discrete mathematics and applications |v 3 |w (DE-604)BV047220660 |9 3 | |
| 856 | 4 | 0 | |u https://doi.org/10.1137/1.9780898719796 |x Verlag |3 Volltext |
| 912 | |a ZDB-72-SIA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-025144715 | ||
| 966 | e | |u https://doi.org/10.1137/1.9780898719796 |l TUM01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9780898719796 |l UBW01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9780898719796 |l UBY01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1137/1.9780898719796 |l UER01 |p ZDB-72-SIA |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804149302468018176 |
|---|---|
| any_adam_object | |
| author | Brandstädt, Andreas 1949- Le, Van Bang 1959- Spinrad, Jeremy P. |
| author_GND | (DE-588)133631737 (DE-588)121863980 |
| author_facet | Brandstädt, Andreas 1949- Le, Van Bang 1959- Spinrad, Jeremy P. |
| author_role | aut aut aut |
| author_sort | Brandstädt, Andreas 1949- |
| author_variant | a b ab v b l vb vbl j p s jp jps |
| building | Verbundindex |
| bvnumber | BV040289498 |
| collection | ZDB-72-SIA |
| ctrlnum | (OCoLC)816193143 (DE-599)BVBBV040289498 |
| doi_str_mv | 10.1137/1.9780898719796 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03199nmm a2200481zcb4500</leader><controlfield tag="001">BV040289498</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210408 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">120703s1999 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780898719796</subfield><subfield code="9">978-0-89871-979-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1137/1.9780898719796</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)816193143</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV040289498</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brandstädt, Andreas</subfield><subfield code="d">1949-</subfield><subfield code="0">(DE-588)133631737</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph classes</subfield><subfield code="b">a survey</subfield><subfield code="c">Andreas Brandstädt, Van Bang Le, Jeremy P. Spinrad</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Philadelphia, Pa.</subfield><subfield code="b">Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)</subfield><subfield code="c">1999</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XI, 304 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">SIAM monographs on discrete mathematics and applications</subfield><subfield code="v">3</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 251-292) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Preface -- 1. Basic concepts -- 2. Perfection, generalized perfection, and related concepts -- 3. Cycles, chords and bridges -- 4. Models and interactions -- 5. Vertex and edge orderings -- 6. Posets -- 7. Forbidden subgraphs -- 8. Hypergraphs and graphs -- 9. Matrices and polyhedra -- 10. Distance properties -- 11. Algebraic compositions and recursive definitions -- 12. Decompositions and cutsets -- 13. Threshold graphs and related concepts -- 14. The strong perfect graph conjecture -- Appendix A. Recognition -- Appendix B. Containment relationships -- Bibliography -- Index</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided to make the book useful to a variety of readers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Le, Van Bang</subfield><subfield code="d">1959-</subfield><subfield code="0">(DE-588)121863980</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Spinrad, Jeremy P.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">SIAM monographs on discrete mathematics and applications</subfield><subfield code="v">3</subfield><subfield code="w">(DE-604)BV047220660</subfield><subfield code="9">3</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1137/1.9780898719796</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-72-SIA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-025144715</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9780898719796</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9780898719796</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9780898719796</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1137/1.9780898719796</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-72-SIA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV040289498 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:20:52Z |
| institution | BVB |
| isbn | 9780898719796 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025144715 |
| oclc_num | 816193143 |
| open_access_boolean | |
| owner | DE-29 DE-91 DE-BY-TUM DE-706 DE-83 DE-20 |
| owner_facet | DE-29 DE-91 DE-BY-TUM DE-706 DE-83 DE-20 |
| physical | 1 Online-Ressource (XI, 304 Seiten) |
| psigel | ZDB-72-SIA |
| publishDate | 1999 |
| publishDateSearch | 1999 |
| publishDateSort | 1999 |
| publisher | Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) |
| record_format | marc |
| series | SIAM monographs on discrete mathematics and applications |
| series2 | SIAM monographs on discrete mathematics and applications |
| spelling | Brandstädt, Andreas 1949- (DE-588)133631737 aut Graph classes a survey Andreas Brandstädt, Van Bang Le, Jeremy P. Spinrad Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 1999 1 Online-Ressource (XI, 304 Seiten) txt rdacontent c rdamedia cr rdacarrier SIAM monographs on discrete mathematics and applications 3 Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader Includes bibliographical references (p. 251-292) and index Preface -- 1. Basic concepts -- 2. Perfection, generalized perfection, and related concepts -- 3. Cycles, chords and bridges -- 4. Models and interactions -- 5. Vertex and edge orderings -- 6. Posets -- 7. Forbidden subgraphs -- 8. Hypergraphs and graphs -- 9. Matrices and polyhedra -- 10. Distance properties -- 11. Algebraic compositions and recursive definitions -- 12. Decompositions and cutsets -- 13. Threshold graphs and related concepts -- 14. The strong perfect graph conjecture -- Appendix A. Recognition -- Appendix B. Containment relationships -- Bibliography -- Index This well-organized reference is a definitive encyclopedia for the literature on graph classes. It contains a survey of more than 200 classes of graphs, organized by types of properties used to define and characterize the classes, citing key theorems and literature references for each. The authors state results without proof, providing readers with easy access to far more key theorems than are commonly found in other mathematical texts. Interconnections between graph classes are also provided to make the book useful to a variety of readers Graph theory Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s DE-604 Le, Van Bang 1959- (DE-588)121863980 aut Spinrad, Jeremy P. aut SIAM monographs on discrete mathematics and applications 3 (DE-604)BV047220660 3 https://doi.org/10.1137/1.9780898719796 Verlag Volltext |
| spellingShingle | Brandstädt, Andreas 1949- Le, Van Bang 1959- Spinrad, Jeremy P. Graph classes a survey SIAM monographs on discrete mathematics and applications Graph theory Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4113782-6 |
| title | Graph classes a survey |
| title_auth | Graph classes a survey |
| title_exact_search | Graph classes a survey |
| title_full | Graph classes a survey Andreas Brandstädt, Van Bang Le, Jeremy P. Spinrad |
| title_fullStr | Graph classes a survey Andreas Brandstädt, Van Bang Le, Jeremy P. Spinrad |
| title_full_unstemmed | Graph classes a survey Andreas Brandstädt, Van Bang Le, Jeremy P. Spinrad |
| title_short | Graph classes |
| title_sort | graph classes a survey |
| title_sub | a survey |
| topic | Graph theory Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Graph theory Graphentheorie |
| url | https://doi.org/10.1137/1.9780898719796 |
| volume_link | (DE-604)BV047220660 |
| work_keys_str_mv | AT brandstadtandreas graphclassesasurvey AT levanbang graphclassesasurvey AT spinradjeremyp graphclassesasurvey |