Graphs and digraphs:
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Belmont, Calif.
Wadsworth
1981
|
Ausgabe: | 2. print. |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | X, 406 S. graph.Darst. |
ISBN: | 053498021X |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV003687198 | ||
003 | DE-604 | ||
005 | 20160802 | ||
007 | t | ||
008 | 900725s1981 d||| |||| 00||| eng d | ||
020 | |a 053498021X |9 0-534-98021-X | ||
035 | |a (OCoLC)312811031 | ||
035 | |a (DE-599)BVBBV003687198 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-384 | ||
084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
100 | 1 | |a Behzad, Mehdi |e Verfasser |4 aut | |
245 | 1 | 0 | |a Graphs and digraphs |c Mehdi Behzad ; Gary Chartrand ; Linda Lesniak-Foster* |
250 | |a 2. print. | ||
264 | 1 | |a Belmont, Calif. |b Wadsworth |c 1981 | |
300 | |a X, 406 S. |b graph.Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Gerichteter Graph |0 (DE-588)4156815-1 |2 gnd |9 rswk-swf |
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 | |8 1\p |5 DE-604 | |
700 | 1 | |a Chartrand, Gary |d 1936- |e Verfasser |0 (DE-588)140142266 |4 aut | |
700 | 1 | |a Lesniak, Linda |d 1948- |e Verfasser |0 (DE-588)1012195260 |4 aut | |
856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002346088&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-002346088 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804118031204352000 |
---|---|
adam_text | Contents
Part I: Graphs
1 Graphs and Subgraphs
1.1 Graphs 2
1.2 Subgraphs 8
1.3 Special Graphs 10
1.4 Operations on Graphs 12
1.5 Degree Sequences and Degree Sets 15
2 Connected and Disconnected Graphs
2.1 Paths and Cycles 20
2.2 Complementary Graphs 26
2.3 Cut vertices and Bridges 29
2.4 Eulerian Graphs 31
2.5 Blocks 36
2.6 Critical and Minimal Blocks 39
3 Matrices, Trees, and Girth
3.1 Graphs and Matrices 42
3.2 Trees 45
3.3 Decomposition of Graphs into Acyclic Subgraphs 52
3.4 The Girth of a Graph 56
vii
viii Contents
4 Planar and Nonplanar Graphs
4.1 Euler s Formula 65
4.2 Nonplanar Graphs 71
4.3 Homeomorphism and Contraction 80
4.4 Characterizations of Planar Graphs 83
4.5 Outerplanar Graphs 88
5 Graph Embeddings
5.1 The Genus of a Graph 91
5.2 2 Cell Embeddings of Graphs 99
5.3 The Maximum Genus of a Graph 113
6 Connectivity and Edge Connectivity
6.1 n Connected and « Edge Connected Graphs 124
6.2 Menger s Theorem 129
7 Hamiltonian Graphs
7.1 Sufficient Conditions for Hamiltonian Graphs 136
7.2 Highly Hamiltonian and Nearly Hamiltonian Graphs 145
7.3 Hamiltonian Graphs and Powers of Graphs 152
7.4 Hamiltonian Planar Graphs 155
8 Matchings, Factorization and Coverings
8.1 Matchings 159
8.2 Factorization 162
8.3 Coverings 170
9 Graphs and Groups
9.1 The Group and Edge Group of a Graph 174
9.2 Cayley Color Graphs 180
Contents ix
10 Graph Isomorphism and Reconstruction
10.1 Line Graphs 187
10.2 The Reconstruction Problem 200
10.3 The Spectrum of a Graph 222
11 Graph Colorings
11.1 The (Vertex) Chromatic Number 230
11.2 Further Results on the Chromatic Number 241
11.3 The Edge Chromatic Number 245
11.4 Further Results on the Edge Chromatic Number 249
12 Map Colorings
12.1 The Four Color Problem 254
12.2 The Four Color Theorem 261
12.3 The Heawood Map Coloring Theorem 270
12.4 A Degenerate Graphs 272
13 Ramsey and Extremal Graph Theory
13.1 Extremal Graph Theory 279
13.2 The Ramsey Numbers 284
13.3 Generalized Ramsey Numbers 288
13.4 Noncomplete Ramsey Theory 293
14 Enumeration of Graphs
14.1 Polya s Theorem 303
14.2 Applications of Polya s Theorem to Graphical Enumeration 312
Part II: Digraphs
15 Connectedness in Digraphs
15.1 Digraphs 318
15.2 Connected and Disconnected Digraphs 323
15.3 Strong Digraphs 331
15.4 Digraphs and Matrices 339
X Contents
16 Eulerian and Hamiltonian Digraphs
16.1 Eulerian Digraphs 341
16.2 Hamiltonian Digraphs 344
17 Tournaments
17.1 Elementary Properties of Tournaments 354
17.2 Hamiltonian Tournaments 357
17.3 Score Sequences 359
18 Networks
18.1 Flows and Cuts 367
18.2 The Max Flow Min Cut Theorem 372
18.3 Applications of the Max Flow Min Cut Theorem 378
Bibliography 383
Index 402
|
any_adam_object | 1 |
author | Behzad, Mehdi Chartrand, Gary 1936- Lesniak, Linda 1948- |
author_GND | (DE-588)140142266 (DE-588)1012195260 |
author_facet | Behzad, Mehdi Chartrand, Gary 1936- Lesniak, Linda 1948- |
author_role | aut aut aut |
author_sort | Behzad, Mehdi |
author_variant | m b mb g c gc l l ll |
building | Verbundindex |
bvnumber | BV003687198 |
classification_rvk | SK 170 |
ctrlnum | (OCoLC)312811031 (DE-599)BVBBV003687198 |
discipline | Mathematik |
edition | 2. print. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01571nam a2200397 c 4500</leader><controlfield tag="001">BV003687198</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160802 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">900725s1981 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">053498021X</subfield><subfield code="9">0-534-98021-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)312811031</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV003687198</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Behzad, Mehdi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graphs and digraphs</subfield><subfield code="c">Mehdi Behzad ; Gary Chartrand ; Linda Lesniak-Foster*</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Belmont, Calif.</subfield><subfield code="b">Wadsworth</subfield><subfield code="c">1981</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 406 S.</subfield><subfield code="b">graph.Darst.</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="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="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="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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" 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="700" ind1="1" ind2=" "><subfield code="a">Lesniak, Linda</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1012195260</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002346088&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002346088</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
id | DE-604.BV003687198 |
illustrated | Illustrated |
indexdate | 2024-07-09T16:03:50Z |
institution | BVB |
isbn | 053498021X |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002346088 |
oclc_num | 312811031 |
open_access_boolean | |
owner | DE-384 |
owner_facet | DE-384 |
physical | X, 406 S. graph.Darst. |
publishDate | 1981 |
publishDateSearch | 1981 |
publishDateSort | 1981 |
publisher | Wadsworth |
record_format | marc |
spelling | Behzad, Mehdi Verfasser aut Graphs and digraphs Mehdi Behzad ; Gary Chartrand ; Linda Lesniak-Foster* 2. print. Belmont, Calif. Wadsworth 1981 X, 406 S. graph.Darst. txt rdacontent n rdamedia nc rdacarrier Graphentheorie (DE-588)4113782-6 gnd rswk-swf Gerichteter Graph (DE-588)4156815-1 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s DE-604 Gerichteter Graph (DE-588)4156815-1 s 1\p DE-604 Chartrand, Gary 1936- Verfasser (DE-588)140142266 aut Lesniak, Linda 1948- Verfasser (DE-588)1012195260 aut HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002346088&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Behzad, Mehdi Chartrand, Gary 1936- Lesniak, Linda 1948- Graphs and digraphs Graphentheorie (DE-588)4113782-6 gnd Gerichteter Graph (DE-588)4156815-1 gnd |
subject_GND | (DE-588)4113782-6 (DE-588)4156815-1 |
title | Graphs and digraphs |
title_auth | Graphs and digraphs |
title_exact_search | Graphs and digraphs |
title_full | Graphs and digraphs Mehdi Behzad ; Gary Chartrand ; Linda Lesniak-Foster* |
title_fullStr | Graphs and digraphs Mehdi Behzad ; Gary Chartrand ; Linda Lesniak-Foster* |
title_full_unstemmed | Graphs and digraphs Mehdi Behzad ; Gary Chartrand ; Linda Lesniak-Foster* |
title_short | Graphs and digraphs |
title_sort | graphs and digraphs |
topic | Graphentheorie (DE-588)4113782-6 gnd Gerichteter Graph (DE-588)4156815-1 gnd |
topic_facet | Graphentheorie Gerichteter Graph |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002346088&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT behzadmehdi graphsanddigraphs AT chartrandgary graphsanddigraphs AT lesniaklinda graphsanddigraphs |