Combinatorics and graph theory:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer
2008
|
| Ausgabe: | 2. ed. |
| Schriftenreihe: | Undergraduate texts in mathematics
|
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Beschreibung: | XV, 381 S. Ill., graph. Darst. 235 mm x 155 mm |
| ISBN: | 9780387797106 0387797106 9780387797113 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035055709 | ||
| 003 | DE-604 | ||
| 005 | 20150720 | ||
| 007 | t | ||
| 008 | 080916s2008 ad|| |||| 00||| eng d | ||
| 015 | |a 08,N16,0521 |2 dnb | ||
| 016 | 7 | |a 988077426 |2 DE-101 | |
| 020 | |a 9780387797106 |c Gb. : ca. EUR 41.20 (freier Pr.), ca. sfr 64.00 (freier Pr.) |9 978-0-387-79710-6 | ||
| 020 | |a 0387797106 |c Gb. : ca. EUR 41.20 (freier Pr.), ca. sfr 64.00 (freier Pr.) |9 0-387-79710-6 | ||
| 020 | |a 9780387797113 |9 978-0-387-79711-3 | ||
| 024 | 3 | |a 9780387797106 | |
| 028 | 5 | 2 | |a 11616429 |
| 035 | |a (OCoLC)233933487 | ||
| 035 | |a (DE-599)DNB988077426 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-824 |a DE-703 |a DE-634 |a DE-355 |a DE-29T |a DE-11 |a DE-91G |a DE-188 |a DE-20 |a DE-N32 | ||
| 050 | 0 | |a QA165 | |
| 082 | 0 | |a 511.6 22 |2 22 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a MAT 055f |2 stub | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a MAT 050f |2 stub | ||
| 100 | 1 | |a Harris, John M. |d 1969- |e Verfasser |0 (DE-588)173765076 |4 aut | |
| 245 | 1 | 0 | |a Combinatorics and graph theory |c John M. Harris ; Jeffry L. Hirst ; Michael J. Mossinghoff |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a New York, NY |b Springer |c 2008 | |
| 300 | |a XV, 381 S. |b Ill., graph. Darst. |c 235 mm x 155 mm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Undergraduate texts in mathematics | |
| 650 | 4 | |a Combinatorial analysis | |
| 650 | 4 | |a Graph theory | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 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 | 1 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Hirst, Jeffry L. |d 1957- |e Verfasser |0 (DE-588)137976178 |4 aut | |
| 700 | 1 | |a Mossinghoff, Michael J. |d 1964- |e Verfasser |0 (DE-588)17279840X |4 aut | |
| 856 | 4 | 2 | |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3085406&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 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=016724302&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-016724302 | |
Datensatz im Suchindex
| _version_ | 1805091076890951680 |
|---|---|
| adam_text |
Contents
Preface to the Second Edition vii
Preface to the First Edition ix
1 Graph Theory 1
1.1 Introductory Concepts . 2
1.1.1 Graphs and Their Relatives. 2
1.1.2 The Basics. 5
1.1.3 Special Types of Graphs. 10
1.2 Distance in Graphs. 17
1.2.1 Definitions and a Few Properties. 18
1.2.2 Graphs and Matrices. 21
1.2.3 Graph Models and Distance. 26
1.3 Trees. 30
1.3.1 Definitions and Examples . 31
1.3.2 Properties of Trees. 34
1.3.3 Spanning Trees. 38
1.3.4 Counting Trees. 43
1.4 Trails, Circuits, Paths, and Cycles . 51
1.4.1 The Bridges of Konigsberg. 52
1.4.2 Eulerian Trails and Circuits . 55
1.4.3 Hamiltonian Paths and Cycles. 60
1.4.4 Three Open Problems . 67
1.5 Planarity. 73
Contents
1.5.1 Definitions and Examples . 74
1.5.2 Euler's Formula and Beyond. 78
1.5.3 Regular Polyhedra. 80
1.5.4 Kuratowski's Theorem. 83
1.6 Colorings. 85
1.6.1 Definitions. 86
1.6.2 Bounds on Chromatic Number. 88
1.6.3 The Four Color Problem. 93
1.6.4 Chromatic Polynomials. 97
1.7 Matchings. 101
1.7.1 Definitions. 102
1.7.2 Hall's Theorem and SDRs. 104
1.7.3 The Konig-Egervary Theorem. 109
1.7.4 Perfect Matchings . Ill
1.8 Ramsey Theory. 116
1.8.1 Classical Ramsey Numbers.116
1.8.2 Exact Ramsey Numbers and Bounds.118
1.8.3 Graph Ramsey Theory.124
1.9 References.126
Combinatorics 129
2.1 Some Essential Problems.130
2.2 Binomial Coefficients.137
2.3 Multinomial Coefficients.144
2.4 The Pigeonhole Principle.150
2.5 The Principle of Inclusion and Exclusion.156
2.6 Generating Functions.164
2.6.1 Double Decks.166
2.6.2 Counting with Repetition.168
2.6.3 Changing Money.171
2.6.4 Fibonacci Numbers.177
2.6.5 Recurrence Relations.181
2.6.6 Catalan Numbers.185
2.7 Polya's Theory of Counting.190
2.7.1 Permutation Groups .191
2.7.2 Burnside's Lemma.196
2.7.3 The Cycle Index.200
2.7.4 Polya's Enumeration Formula.202
2.7.5 de Bruijn's Generalization.209
2.8 More Numbers.217
2.8.1 Partitions.218
2.8.2 Stirling Cycle Numbers .227
2.8.3 Stirling Set Numbers.231
2.8.4 Bell Numbers.237
2.8.5 Eulerian Numbers .242
Contents xv
2.9 Stable Marriage. 248
2.9.1 The Gale-Shapley Algorithm . 250
2.9.2 Variations on Stable Marriage. 255
2.10 Combinatorial Geometry. 264
2.10.1 Sylvester's Problem . 265
2.10.2 Convex Polygons. 270
2.11 References. 277
3 Infinite Combinatorics and Graphs 281
3.1 Pigeons and Trees. 282
3.2 Ramsey Revisited. 285
3.3 ZFC. 290
3.3.1 Language and Logical Axioms. 290
3.3.2 Proper Axioms. 292
3.3.3 Axiom of Choice. 297
3.4 The Return of der Konig. 301
3.5 Ordinals, Cardinals, and Many Pigeons . 304
3.5.1 Cardinality. 304
3.5.2 Ordinals and Cardinals. 308
3.5.3 Pigeons Finished Off. 312
3.6 Incompleteness and Cardinals . 318
3.6.1 Godel's Theorems for PA and ZFC. 318
3.6.2 Inaccessible Cardinals. 320
3.6.3 A Small Collage of Large Cardinals. 322
3.7 Weakly Compact Cardinals. 324
3.8 Infinite Marriage Problems. 327
3.8.1 Hall and Hall. 328
3.8.2 Countably Many Men . 330
3.8.3 Uncountably Many Men. 336
3.8.4 Espousable Cardinals. 340
3.8.5 Perfect Matchings . 343
3.9 Finite Combinatorics with Infinite Consequences. 344
3.10 fr-critical Linear Orderings. 347
3.11 Points of Departure. 348
3.12 References. 352
References 355
Index 369 |
| adam_txt |
Contents
Preface to the Second Edition vii
Preface to the First Edition ix
1 Graph Theory 1
1.1 Introductory Concepts . 2
1.1.1 Graphs and Their Relatives. 2
1.1.2 The Basics. 5
1.1.3 Special Types of Graphs. 10
1.2 Distance in Graphs. 17
1.2.1 Definitions and a Few Properties. 18
1.2.2 Graphs and Matrices. 21
1.2.3 Graph Models and Distance. 26
1.3 Trees. 30
1.3.1 Definitions and Examples . 31
1.3.2 Properties of Trees. 34
1.3.3 Spanning Trees. 38
1.3.4 Counting Trees. 43
1.4 Trails, Circuits, Paths, and Cycles . 51
1.4.1 The Bridges of Konigsberg. 52
1.4.2 Eulerian Trails and Circuits . 55
1.4.3 Hamiltonian Paths and Cycles. 60
1.4.4 Three Open Problems . 67
1.5 Planarity. 73
Contents
1.5.1 Definitions and Examples . 74
1.5.2 Euler's Formula and Beyond. 78
1.5.3 Regular Polyhedra. 80
1.5.4 Kuratowski's Theorem. 83
1.6 Colorings. 85
1.6.1 Definitions. 86
1.6.2 Bounds on Chromatic Number. 88
1.6.3 The Four Color Problem. 93
1.6.4 Chromatic Polynomials. 97
1.7 Matchings. 101
1.7.1 Definitions. 102
1.7.2 Hall's Theorem and SDRs. 104
1.7.3 The Konig-Egervary Theorem. 109
1.7.4 Perfect Matchings . Ill
1.8 Ramsey Theory. 116
1.8.1 Classical Ramsey Numbers.116
1.8.2 Exact Ramsey Numbers and Bounds.118
1.8.3 Graph Ramsey Theory.124
1.9 References.126
Combinatorics 129
2.1 Some Essential Problems.130
2.2 Binomial Coefficients.137
2.3 Multinomial Coefficients.144
2.4 The Pigeonhole Principle.150
2.5 The Principle of Inclusion and Exclusion.156
2.6 Generating Functions.164
2.6.1 Double Decks.166
2.6.2 Counting with Repetition.168
2.6.3 Changing Money.171
2.6.4 Fibonacci Numbers.177
2.6.5 Recurrence Relations.181
2.6.6 Catalan Numbers.185
2.7 Polya's Theory of Counting.190
2.7.1 Permutation Groups .191
2.7.2 Burnside's Lemma.196
2.7.3 The Cycle Index.200
2.7.4 Polya's Enumeration Formula.202
2.7.5 de Bruijn's Generalization.209
2.8 More Numbers.217
2.8.1 Partitions.218
2.8.2 Stirling Cycle Numbers .227
2.8.3 Stirling Set Numbers.231
2.8.4 Bell Numbers.237
2.8.5 Eulerian Numbers .242
Contents xv
2.9 Stable Marriage. 248
2.9.1 The Gale-Shapley Algorithm . 250
2.9.2 Variations on Stable Marriage. 255
2.10 Combinatorial Geometry. 264
2.10.1 Sylvester's Problem . 265
2.10.2 Convex Polygons. 270
2.11 References. 277
3 Infinite Combinatorics and Graphs 281
3.1 Pigeons and Trees. 282
3.2 Ramsey Revisited. 285
3.3 ZFC. 290
3.3.1 Language and Logical Axioms. 290
3.3.2 Proper Axioms. 292
3.3.3 Axiom of Choice. 297
3.4 The Return of der Konig. 301
3.5 Ordinals, Cardinals, and Many Pigeons . 304
3.5.1 Cardinality. 304
3.5.2 Ordinals and Cardinals. 308
3.5.3 Pigeons Finished Off. 312
3.6 Incompleteness and Cardinals . 318
3.6.1 Godel's Theorems for PA and ZFC. 318
3.6.2 Inaccessible Cardinals. 320
3.6.3 A Small Collage of Large Cardinals. 322
3.7 Weakly Compact Cardinals. 324
3.8 Infinite Marriage Problems. 327
3.8.1 Hall and Hall. 328
3.8.2 Countably Many Men . 330
3.8.3 Uncountably Many Men. 336
3.8.4 Espousable Cardinals. 340
3.8.5 Perfect Matchings . 343
3.9 Finite Combinatorics with Infinite Consequences. 344
3.10 fr-critical Linear Orderings. 347
3.11 Points of Departure. 348
3.12 References. 352
References 355
Index 369 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Harris, John M. 1969- Hirst, Jeffry L. 1957- Mossinghoff, Michael J. 1964- |
| author_GND | (DE-588)173765076 (DE-588)137976178 (DE-588)17279840X |
| author_facet | Harris, John M. 1969- Hirst, Jeffry L. 1957- Mossinghoff, Michael J. 1964- |
| author_role | aut aut aut |
| author_sort | Harris, John M. 1969- |
| author_variant | j m h jm jmh j l h jl jlh m j m mj mjm |
| building | Verbundindex |
| bvnumber | BV035055709 |
| callnumber-first | Q - Science |
| callnumber-label | QA165 |
| callnumber-raw | QA165 |
| callnumber-search | QA165 |
| callnumber-sort | QA 3165 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 170 SK 890 |
| classification_tum | MAT 055f MAT 050f |
| ctrlnum | (OCoLC)233933487 (DE-599)DNB988077426 |
| dewey-full | 511.622 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.6 22 |
| dewey-search | 511.6 22 |
| dewey-sort | 3511.6 222 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| edition | 2. ed. |
| 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">BV035055709</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150720</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080916s2008 ad|| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">08,N16,0521</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">988077426</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387797106</subfield><subfield code="c">Gb. : ca. EUR 41.20 (freier Pr.), ca. sfr 64.00 (freier Pr.)</subfield><subfield code="9">978-0-387-79710-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387797106</subfield><subfield code="c">Gb. : ca. EUR 41.20 (freier Pr.), ca. sfr 64.00 (freier Pr.)</subfield><subfield code="9">0-387-79710-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387797113</subfield><subfield code="9">978-0-387-79711-3</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9780387797106</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">11616429</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)233933487</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB988077426</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-824</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-N32</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA165</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6 22</subfield><subfield code="2">22</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="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 050f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harris, John M.</subfield><subfield code="d">1969-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)173765076</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorics and graph theory</subfield><subfield code="c">John M. Harris ; Jeffry L. Hirst ; Michael J. Mossinghoff</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 381 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield><subfield code="c">235 mm x 155 mm</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">Undergraduate texts in mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</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="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="1"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</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">Hirst, Jeffry L.</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)137976178</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mossinghoff, Michael J.</subfield><subfield code="d">1964-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)17279840X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3085406&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</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=016724302&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016724302</subfield></datafield></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV035055709 |
| illustrated | Illustrated |
| index_date | 2024-07-02T21:58:21Z |
| indexdate | 2024-07-20T09:49:58Z |
| institution | BVB |
| isbn | 9780387797106 0387797106 9780387797113 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016724302 |
| oclc_num | 233933487 |
| open_access_boolean | |
| owner | DE-824 DE-703 DE-634 DE-355 DE-BY-UBR DE-29T DE-11 DE-91G DE-BY-TUM DE-188 DE-20 DE-N32 |
| owner_facet | DE-824 DE-703 DE-634 DE-355 DE-BY-UBR DE-29T DE-11 DE-91G DE-BY-TUM DE-188 DE-20 DE-N32 |
| physical | XV, 381 S. Ill., graph. Darst. 235 mm x 155 mm |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Springer |
| record_format | marc |
| series2 | Undergraduate texts in mathematics |
| spelling | Harris, John M. 1969- Verfasser (DE-588)173765076 aut Combinatorics and graph theory John M. Harris ; Jeffry L. Hirst ; Michael J. Mossinghoff 2. ed. New York, NY Springer 2008 XV, 381 S. Ill., graph. Darst. 235 mm x 155 mm txt rdacontent n rdamedia nc rdacarrier Undergraduate texts in mathematics Combinatorial analysis Graph theory Graphentheorie (DE-588)4113782-6 gnd rswk-swf Kombinatorik (DE-588)4031824-2 gnd rswk-swf (DE-588)4123623-3 Lehrbuch gnd-content Graphentheorie (DE-588)4113782-6 s Kombinatorik (DE-588)4031824-2 s DE-604 Hirst, Jeffry L. 1957- Verfasser (DE-588)137976178 aut Mossinghoff, Michael J. 1964- Verfasser (DE-588)17279840X aut text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3085406&prov=M&dok_var=1&dok_ext=htm Inhaltstext HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016724302&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Harris, John M. 1969- Hirst, Jeffry L. 1957- Mossinghoff, Michael J. 1964- Combinatorics and graph theory Combinatorial analysis Graph theory Graphentheorie (DE-588)4113782-6 gnd Kombinatorik (DE-588)4031824-2 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4031824-2 (DE-588)4123623-3 |
| title | Combinatorics and graph theory |
| title_auth | Combinatorics and graph theory |
| title_exact_search | Combinatorics and graph theory |
| title_exact_search_txtP | Combinatorics and graph theory |
| title_full | Combinatorics and graph theory John M. Harris ; Jeffry L. Hirst ; Michael J. Mossinghoff |
| title_fullStr | Combinatorics and graph theory John M. Harris ; Jeffry L. Hirst ; Michael J. Mossinghoff |
| title_full_unstemmed | Combinatorics and graph theory John M. Harris ; Jeffry L. Hirst ; Michael J. Mossinghoff |
| title_short | Combinatorics and graph theory |
| title_sort | combinatorics and graph theory |
| topic | Combinatorial analysis Graph theory Graphentheorie (DE-588)4113782-6 gnd Kombinatorik (DE-588)4031824-2 gnd |
| topic_facet | Combinatorial analysis Graph theory Graphentheorie Kombinatorik Lehrbuch |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3085406&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016724302&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT harrisjohnm combinatoricsandgraphtheory AT hirstjeffryl combinatoricsandgraphtheory AT mossinghoffmichaelj combinatoricsandgraphtheory |