Graphs & digraphs:
"Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory. This classic text, widely popular among students and instru...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Boca Raton, FL
CRC Press, Taylor & Francis Group
2024
|
| Edition: | Seventh edition |
| Series: | Textbooks in mathematics
|
| Subjects: | |
| Summary: | "Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory. This classic text, widely popular among students and instructor alike for decades, is thoroughly streamlined in this new, seventh edition, to present a text consistent with contemporary expectations"-- Cover -- Half Title -- Series Page -- Title Page -- Copyright Page -- Contents -- Preface to the seventh edition -- About the authors -- 1. Graphs -- 1.1. Fundamentals -- 1.2. Isomorphism -- 1.3. Families of graphs -- 1.4. Operations on graphs -- 1.5. Degree sequences -- 1.6. Path and cycles -- 1.7. Connected graphs and distance -- 1.8. Trees and forests -- 1.9. Multigraphs and pseudographs -- Exercises -- 2. Digraphs -- 2.1. Fundamentals -- 2.2. Strongly connected digraphs -- 2.3. Tournaments -- 2.4. Score sequences -- Exercises -- 3. Traversability -- 3.1. Eulerian graphs and digraphs -- 3.2. Hamiltonian graphs -- 3.3. Hamiltonian digraphs -- 3.4. Highly hamiltonian graphs -- 3.5. Graph powers -- Exercises -- 4. Connectivity -- 4.1. Cut-vertices, bridges, and blocks -- 4.2. Vertex connectivity -- 4.3. Edge-connectivity -- 4.4. Menger's theorem -- Exercises -- 5. Planarity -- 5.1. Euler's formula -- 5.2. Characterizations of planarity -- 5.3. Hamiltonian planar graphs -- 5.4. The crossing number of a graph -- Exercises -- 6. Coloring -- 6.1. Vertex coloring -- 6.2. Edge coloring -- 6.3. Critical and perfect graphs -- 6.4. Maps and planar graphs -- Exercises -- 7. Flows -- 7.1. Networks -- 7.2. Max-flow min-cut theorem -- 7.3. Menger's theorems for digraphs -- 7.4. A connection to coloring -- Exercises -- 8. Factors and covers -- 8.1. Matchings and 1-factors -- 8.2. Independence and covers -- 8.3. Domination -- 8.4. Factorizations and decompositions -- 8.5. Labelings of graphs -- Exercises -- 9. Extremal graph theory -- 9.1. Avoiding a complete graph -- 9.2. Containing cycles and trees -- 9.3. Ramsey theory -- 9.4. Cages and Moore graphs -- Exercises -- 10. Embeddings -- 10.1. The genus of a graph -- 10.2. 2-Cell embeddings of graphs -- 10.3. The maximum genus of a graph -- 10.4. The graph minor theorem -- Exercises -- 11. Graphs and algebra. |
| Item Description: | A Chapman & Hall book Literaturverzeichnis: Seite 329-344 |
| Physical Description: | x, 354 Seiten Illustrationen |
| ISBN: | 9781032133409 9781032606989 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV049810656 | ||
| 003 | DE-604 | ||
| 007 | t | ||
| 008 | 240806s2024 xxua||| |||| 00||| eng d | ||
| 020 | |a 9781032133409 |c hardback |9 978-1-03-213340-9 | ||
| 020 | |a 9781032606989 |c paperback |9 978-1-032-60698-9 | ||
| 035 | |a (OCoLC)1434741300 | ||
| 035 | |a (DE-599)KXP1866088726 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a xxu |c XD-US |a xxk |c XA-GB | ||
| 049 | |a DE-573 | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Chartrand, Gary |d 1936- |e Verfasser |0 (DE-588)140142266 |4 aut | |
| 245 | 1 | 0 | |a Graphs & digraphs |c Gary Chartrand, Heather Jordon, Vincent Vatter, Ping Zhang |
| 246 | 1 | 3 | |a Graphs and digraphs |
| 250 | |a Seventh edition | ||
| 264 | 1 | |a Boca Raton, FL |b CRC Press, Taylor & Francis Group |c 2024 | |
| 300 | |a x, 354 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Textbooks in mathematics | |
| 500 | |a A Chapman & Hall book | ||
| 500 | |a Literaturverzeichnis: Seite 329-344 | ||
| 520 | 3 | |a "Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory. This classic text, widely popular among students and instructor alike for decades, is thoroughly streamlined in this new, seventh edition, to present a text consistent with contemporary expectations"-- | |
| 520 | 3 | |a Cover -- Half Title -- Series Page -- Title Page -- Copyright Page -- Contents -- Preface to the seventh edition -- About the authors -- 1. Graphs -- 1.1. Fundamentals -- 1.2. Isomorphism -- 1.3. Families of graphs -- 1.4. Operations on graphs -- 1.5. Degree sequences -- 1.6. Path and cycles -- 1.7. Connected graphs and distance -- 1.8. Trees and forests -- 1.9. Multigraphs and pseudographs -- Exercises -- 2. Digraphs -- 2.1. Fundamentals -- 2.2. Strongly connected digraphs -- 2.3. Tournaments -- 2.4. Score sequences -- Exercises -- 3. Traversability -- 3.1. Eulerian graphs and digraphs -- 3.2. Hamiltonian graphs -- 3.3. Hamiltonian digraphs -- 3.4. Highly hamiltonian graphs -- 3.5. Graph powers -- Exercises -- 4. Connectivity -- 4.1. Cut-vertices, bridges, and blocks -- 4.2. Vertex connectivity -- 4.3. Edge-connectivity -- 4.4. Menger's theorem -- Exercises -- 5. Planarity -- 5.1. Euler's formula -- 5.2. Characterizations of planarity -- 5.3. Hamiltonian planar graphs -- 5.4. The crossing number of a graph -- Exercises -- 6. Coloring -- 6.1. Vertex coloring -- 6.2. Edge coloring -- 6.3. Critical and perfect graphs -- 6.4. Maps and planar graphs -- Exercises -- 7. Flows -- 7.1. Networks -- 7.2. Max-flow min-cut theorem -- 7.3. Menger's theorems for digraphs -- 7.4. A connection to coloring -- Exercises -- 8. Factors and covers -- 8.1. Matchings and 1-factors -- 8.2. Independence and covers -- 8.3. Domination -- 8.4. Factorizations and decompositions -- 8.5. Labelings of graphs -- Exercises -- 9. Extremal graph theory -- 9.1. Avoiding a complete graph -- 9.2. Containing cycles and trees -- 9.3. Ramsey theory -- 9.4. Cages and Moore graphs -- Exercises -- 10. Embeddings -- 10.1. The genus of a graph -- 10.2. 2-Cell embeddings of graphs -- 10.3. The maximum genus of a graph -- 10.4. The graph minor theorem -- Exercises -- 11. Graphs and algebra. | |
| 650 | 0 | 7 | |a Gerichteter Graph |0 (DE-588)4156815-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 653 | 0 | |a Graph theory | |
| 653 | 0 | |a Directed graphs | |
| 655 | 7 | |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Gerichteter Graph |0 (DE-588)4156815-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Jordon, Heather |e Verfasser |4 aut | |
| 700 | 1 | |a Vatter, Vincent |e Verfasser |4 aut | |
| 700 | 1 | |a Zhang, Ping |d 1957- |e Verfasser |0 (DE-588)1012212335 |4 aut | |
| 710 | 2 | |a CRC Press |0 (DE-588)2174009-4 |4 pbl | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035151040 | |
Record in the Search Index
| _version_ | 1809767362031779840 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Chartrand, Gary 1936- Jordon, Heather Vatter, Vincent Zhang, Ping 1957- |
| author_GND | (DE-588)140142266 (DE-588)1012212335 |
| author_facet | Chartrand, Gary 1936- Jordon, Heather Vatter, Vincent Zhang, Ping 1957- |
| author_role | aut aut aut aut |
| author_sort | Chartrand, Gary 1936- |
| author_variant | g c gc h j hj v v vv p z pz |
| building | Verbundindex |
| bvnumber | BV049810656 |
| classification_rvk | SK 890 |
| ctrlnum | (OCoLC)1434741300 (DE-599)KXP1866088726 |
| discipline | Mathematik |
| edition | Seventh edition |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV049810656</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">240806s2024 xxua||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781032133409</subfield><subfield code="c">hardback</subfield><subfield code="9">978-1-03-213340-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781032606989</subfield><subfield code="c">paperback</subfield><subfield code="9">978-1-032-60698-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1434741300</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1866088726</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="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">XD-US</subfield><subfield code="a">xxk</subfield><subfield code="c">XA-GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-573</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chartrand, Gary</subfield><subfield code="d">1936-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140142266</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graphs & digraphs</subfield><subfield code="c">Gary Chartrand, Heather Jordon, Vincent Vatter, Ping Zhang</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Graphs and digraphs</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Seventh edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton, FL</subfield><subfield code="b">CRC Press, Taylor & Francis Group</subfield><subfield code="c">2024</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">x, 354 Seiten</subfield><subfield code="b">Illustrationen</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Textbooks in mathematics</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">A Chapman & Hall book</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverzeichnis: Seite 329-344</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">"Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory. This classic text, widely popular among students and instructor alike for decades, is thoroughly streamlined in this new, seventh edition, to present a text consistent with contemporary expectations"--</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Cover -- Half Title -- Series Page -- Title Page -- Copyright Page -- Contents -- Preface to the seventh edition -- About the authors -- 1. Graphs -- 1.1. Fundamentals -- 1.2. Isomorphism -- 1.3. Families of graphs -- 1.4. Operations on graphs -- 1.5. Degree sequences -- 1.6. Path and cycles -- 1.7. Connected graphs and distance -- 1.8. Trees and forests -- 1.9. Multigraphs and pseudographs -- Exercises -- 2. Digraphs -- 2.1. Fundamentals -- 2.2. Strongly connected digraphs -- 2.3. Tournaments -- 2.4. Score sequences -- Exercises -- 3. Traversability -- 3.1. Eulerian graphs and digraphs -- 3.2. Hamiltonian graphs -- 3.3. Hamiltonian digraphs -- 3.4. Highly hamiltonian graphs -- 3.5. Graph powers -- Exercises -- 4. Connectivity -- 4.1. Cut-vertices, bridges, and blocks -- 4.2. Vertex connectivity -- 4.3. Edge-connectivity -- 4.4. Menger's theorem -- Exercises -- 5. Planarity -- 5.1. Euler's formula -- 5.2. Characterizations of planarity -- 5.3. Hamiltonian planar graphs -- 5.4. The crossing number of a graph -- Exercises -- 6. Coloring -- 6.1. Vertex coloring -- 6.2. Edge coloring -- 6.3. Critical and perfect graphs -- 6.4. Maps and planar graphs -- Exercises -- 7. Flows -- 7.1. Networks -- 7.2. Max-flow min-cut theorem -- 7.3. Menger's theorems for digraphs -- 7.4. A connection to coloring -- Exercises -- 8. Factors and covers -- 8.1. Matchings and 1-factors -- 8.2. Independence and covers -- 8.3. Domination -- 8.4. Factorizations and decompositions -- 8.5. Labelings of graphs -- Exercises -- 9. Extremal graph theory -- 9.1. Avoiding a complete graph -- 9.2. Containing cycles and trees -- 9.3. Ramsey theory -- 9.4. Cages and Moore graphs -- Exercises -- 10. Embeddings -- 10.1. The genus of a graph -- 10.2. 2-Cell embeddings of graphs -- 10.3. The maximum genus of a graph -- 10.4. The graph minor theorem -- Exercises -- 11. Graphs and algebra.</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gerichteter Graph</subfield><subfield code="0">(DE-588)4156815-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="653" ind1=" " ind2="0"><subfield code="a">Graph theory</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Directed graphs</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</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="689" ind1="1" ind2="0"><subfield code="a">Gerichteter Graph</subfield><subfield code="0">(DE-588)4156815-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jordon, Heather</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vatter, Vincent</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Ping</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1012212335</subfield><subfield code="4">aut</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">CRC Press</subfield><subfield code="0">(DE-588)2174009-4</subfield><subfield code="4">pbl</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035151040</subfield></datafield></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV049810656 |
| illustrated | Illustrated |
| indexdate | 2024-09-10T00:37:31Z |
| institution | BVB |
| institution_GND | (DE-588)2174009-4 |
| isbn | 9781032133409 9781032606989 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035151040 |
| oclc_num | 1434741300 |
| open_access_boolean | |
| owner | DE-573 |
| owner_facet | DE-573 |
| physical | x, 354 Seiten Illustrationen |
| publishDate | 2024 |
| publishDateSearch | 2024 |
| publishDateSort | 2024 |
| publisher | CRC Press, Taylor & Francis Group |
| record_format | marc |
| series2 | Textbooks in mathematics |
| spelling | Chartrand, Gary 1936- Verfasser (DE-588)140142266 aut Graphs & digraphs Gary Chartrand, Heather Jordon, Vincent Vatter, Ping Zhang Graphs and digraphs Seventh edition Boca Raton, FL CRC Press, Taylor & Francis Group 2024 x, 354 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Textbooks in mathematics A Chapman & Hall book Literaturverzeichnis: Seite 329-344 "Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory. This classic text, widely popular among students and instructor alike for decades, is thoroughly streamlined in this new, seventh edition, to present a text consistent with contemporary expectations"-- Cover -- Half Title -- Series Page -- Title Page -- Copyright Page -- Contents -- Preface to the seventh edition -- About the authors -- 1. Graphs -- 1.1. Fundamentals -- 1.2. Isomorphism -- 1.3. Families of graphs -- 1.4. Operations on graphs -- 1.5. Degree sequences -- 1.6. Path and cycles -- 1.7. Connected graphs and distance -- 1.8. Trees and forests -- 1.9. Multigraphs and pseudographs -- Exercises -- 2. Digraphs -- 2.1. Fundamentals -- 2.2. Strongly connected digraphs -- 2.3. Tournaments -- 2.4. Score sequences -- Exercises -- 3. Traversability -- 3.1. Eulerian graphs and digraphs -- 3.2. Hamiltonian graphs -- 3.3. Hamiltonian digraphs -- 3.4. Highly hamiltonian graphs -- 3.5. Graph powers -- Exercises -- 4. Connectivity -- 4.1. Cut-vertices, bridges, and blocks -- 4.2. Vertex connectivity -- 4.3. Edge-connectivity -- 4.4. Menger's theorem -- Exercises -- 5. Planarity -- 5.1. Euler's formula -- 5.2. Characterizations of planarity -- 5.3. Hamiltonian planar graphs -- 5.4. The crossing number of a graph -- Exercises -- 6. Coloring -- 6.1. Vertex coloring -- 6.2. Edge coloring -- 6.3. Critical and perfect graphs -- 6.4. Maps and planar graphs -- Exercises -- 7. Flows -- 7.1. Networks -- 7.2. Max-flow min-cut theorem -- 7.3. Menger's theorems for digraphs -- 7.4. A connection to coloring -- Exercises -- 8. Factors and covers -- 8.1. Matchings and 1-factors -- 8.2. Independence and covers -- 8.3. Domination -- 8.4. Factorizations and decompositions -- 8.5. Labelings of graphs -- Exercises -- 9. Extremal graph theory -- 9.1. Avoiding a complete graph -- 9.2. Containing cycles and trees -- 9.3. Ramsey theory -- 9.4. Cages and Moore graphs -- Exercises -- 10. Embeddings -- 10.1. The genus of a graph -- 10.2. 2-Cell embeddings of graphs -- 10.3. The maximum genus of a graph -- 10.4. The graph minor theorem -- Exercises -- 11. Graphs and algebra. Gerichteter Graph (DE-588)4156815-1 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graph theory Directed graphs (DE-588)4123623-3 Lehrbuch gnd-content Graphentheorie (DE-588)4113782-6 s DE-604 Gerichteter Graph (DE-588)4156815-1 s Jordon, Heather Verfasser aut Vatter, Vincent Verfasser aut Zhang, Ping 1957- Verfasser (DE-588)1012212335 aut CRC Press (DE-588)2174009-4 pbl |
| spellingShingle | Chartrand, Gary 1936- Jordon, Heather Vatter, Vincent Zhang, Ping 1957- Graphs & digraphs Gerichteter Graph (DE-588)4156815-1 gnd Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4156815-1 (DE-588)4113782-6 (DE-588)4123623-3 |
| title | Graphs & digraphs |
| title_alt | Graphs and digraphs |
| title_auth | Graphs & digraphs |
| title_exact_search | Graphs & digraphs |
| title_full | Graphs & digraphs Gary Chartrand, Heather Jordon, Vincent Vatter, Ping Zhang |
| title_fullStr | Graphs & digraphs Gary Chartrand, Heather Jordon, Vincent Vatter, Ping Zhang |
| title_full_unstemmed | Graphs & digraphs Gary Chartrand, Heather Jordon, Vincent Vatter, Ping Zhang |
| title_short | Graphs & digraphs |
| title_sort | graphs digraphs |
| topic | Gerichteter Graph (DE-588)4156815-1 gnd Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Gerichteter Graph Graphentheorie Lehrbuch |
| work_keys_str_mv | AT chartrandgary graphsdigraphs AT jordonheather graphsdigraphs AT vattervincent graphsdigraphs AT zhangping graphsdigraphs AT crcpress graphsdigraphs AT chartrandgary graphsanddigraphs AT jordonheather graphsanddigraphs AT vattervincent graphsanddigraphs AT zhangping graphsanddigraphs AT crcpress graphsanddigraphs |