Graph theory and its applications:
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Boca Raton, Fla. [u.a.]
Chapman & Hall/CRC
2006
|
Ausgabe: | Second edition |
Schriftenreihe: | Discrete Mathematics and its Applications
|
Schlagworte: | |
Online-Zugang: | Table of contents only Publisher description Inhaltsverzeichnis |
Beschreibung: | Includes bibliographical references (S. 695-708) and indexes |
Beschreibung: | 779 Seiten Ill., graph. Darst. |
ISBN: | 158488505X 9781584885054 |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV022951430 | ||
003 | DE-604 | ||
005 | 20210318 | ||
007 | t | ||
008 | 071108s2006 xxuad|| |||| 00||| eng d | ||
020 | |a 158488505X |c acidfree paper |9 1-58488-505-X | ||
020 | |a 9781584885054 |9 978-1-58488-505-4 | ||
035 | |a (OCoLC)61458362 | ||
035 | |a (DE-599)BVBBV022951430 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
044 | |a xxu |c US | ||
049 | |a DE-92 |a DE-634 |a DE-521 |a DE-91G |a DE-83 |a DE-188 |a DE-1050 | ||
050 | 0 | |a QA166 | |
082 | 0 | |a 511/.5 | |
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
084 | |a MAT 055f |2 stub | ||
084 | |a 05Cxx |2 msc | ||
100 | 1 | |a Gross, Jonathan L. |d 1941- |e Verfasser |0 (DE-588)124283926 |4 aut | |
245 | 1 | 0 | |a Graph theory and its applications |c Jonathan L. Gross, Jay Yellen |
250 | |a Second edition | ||
264 | 1 | |a Boca Raton, Fla. [u.a.] |b Chapman & Hall/CRC |c 2006 | |
300 | |a 779 Seiten |b Ill., graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Discrete Mathematics and its Applications | |
500 | |a Includes bibliographical references (S. 695-708) and indexes | ||
650 | 4 | |a Graphes, Théorie des | |
650 | 7 | |a Matemática discreta |2 larpcal | |
650 | 7 | |a Teoria dos grafos |2 larpcal | |
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 Yellen, Jay |e Verfasser |0 (DE-588)141942878 |4 aut | |
856 | 4 | |u http://www.loc.gov/catdir/toc/fy0602/2005052906.html |3 Table of contents only | |
856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0647/2005052906-d.html |3 Publisher description | |
856 | 4 | 2 | |m HEBIS Datenaustausch Darmstadt |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016155893&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-016155893 |
Datensatz im Suchindex
_version_ | 1804137195074748416 |
---|---|
adam_text | DISCRETE MATHEMATICS AND ITS APPLICATIONS SERIES EDITOR KENNETH H. ROSEN
GRAPH THEORY AND ITS APPLICATIONS SECOND EDITION JONATHAN L GROSS
JAYYELLEN CHAPMAN & HALL/CRC TAYLOR & FRANCIS GROUP BOCA RATON LONDON
NEW YORK CONTENTS PREFACE 1. INTRODUCTION TO GRAPH MODELS 1 1.1 GRAPHS
AND DIGRAPHS 2 1.2 COMMON FAMILIES OF GRAPHS 15 1.3 GRAPH MODELING
APPLICATIONS 22 1.4 WALKS AND DISTANCE 28 1.5 PATHS, CYCLES, AND TREES
39 1.6 VERTEX AND EDGE ATTRIBUTES: MORE APPLICATIONS 48 1.7
SUPPLEMENTARY EXERCISES 51 GLOSSARY 53 2. STRUCTURE AND REPRESENTATION
57 2.1 GRAPH ISOMORPHISM 58 2.2 AUTOMORPHISMS AND SYMMETRY 65 2.3
SUBGRAPHS 72 2.4 SOME GRAPH OPERATIONS 80 2.5 TESTS FOR NON-ISOMORPHISM
89 2.6 MATRIX REPRESENTATIONS 95 2.7 MORE GRAPH OPERATIONS 101 2.8
SUPPLEMENTARY EXERCISES 107 GLOSSARY 110 3. TREES 115 3.1
CHARACTERIZATIONS AND PROPERTIES OF TREES 116 3.2 ROOTED TREES, ORDERED
TREES, AND BINARY TREES 124 3.3 BINARY-TREE TRAVERSALS 132 3.4
BINARY-SEARCH TREES 137 3.5 HUFFMAN TREES AND OPTIMAL PREFIX CODES 141
3.6 PRIORITY TREES 146 3.7 COUNTING LABELED TREES: PRIIFER ENCODING 151
3.8 COUNTING BINARY TREES: CATALAN RECURSION 156 3.9 SUPPLEMENTARY
EXERCISES 158 GLOSSARY 160 4. SPANNING TREES 163 4.1 TREE GROWING 164
4.2 DEPTH-FIRST AND BREADTH-FIRST SEARCH 171 4.3 MINIMUM SPANNING TREES
AND SHORTEST PATHS 176 4.4 APPLICATIONS OF DEPTH-FIRST SEARCH 182 4.5
CYCLES, EDGE-CUTS, AND SPANNING TREES 190 4.6 GRAPHS AND VECTOR SPACES
197 4.7 MATROIDS AND THE GREEDY ALGORITHM 207 4.8 SUPPLEMENTARY
EXERCISES 212 GLOSSARY 213 5. CONNECTIVITY 217 5.1 VERTEX- AND
EDGE-CONNECTIVITY 218 5.2 CONSTRUCTING RELIABLE NETWORKS 223 5.3 MAX-MIN
DUALITY AND MENGER S THEOREMS 231 5.4 BLOCK DECOMPOSITIONS 241 5.5
SUPPLEMENTARY EXERCISES 244 GLOSSARY 245 6. OPTIMAL GRAPH TRAVERSALS 247
6.1 EULERIAN TRAILS AND TOURS 248 6.2 DEBRUIJN SEQUENCES AND POSTMAN
PROBLEMS 252 6.3 HAMILTONIAN PATHS AND CYCLES 267 6.4 GRAY CODES AND
TRAVELING SALESMAN PROBLEMS 273 6.5 SUPPLEMENTARY EXERCISES 282 GLOSSARY
283 7. PLANARITY AND KURATOWSKI S THEOREM 285 7.1 PLANAR DRAWINGS AND
SOME BASIC SURFACES 286 7.2 SUBDIVISION AND HOMEOMORPHISM 292 7.3
EXTENDING PLANAR DRAWINGS 297 7.4 KURATOWSKI S THEOREM 304 7.5 ALGEBRAIC
TESTS FOR PLANARITY 311 7.6 PLANARITY ALGORITHM 324 7.7 CROSSING NUMBERS
AND THICKNESS 327 7.8 SUPPLEMENTARY EXERCISES 331 GLOSSARY 334 8.
DRAWING GRAPHS AND MAPS 337 8.1 THE TOPOLOGY OF LOW DIMENSIONS 338 8.2
HIGHER-ORDER SURFACES 341 8.3 MATHEMATICAL MODEL FOR DRAWING GRAPHS 346
8.4 REGULAR MAPS ON A SPHERE 349 8.5 IMBEDDINGS ON HIGHER-ORDER SURFACES
354 8.6 GEOMETRIC DRAWINGS OF GRAPHS 361 8.7 SUPPLEMENTARY EXERCISES 365
GLOSSARY 366 9. GRAPH COLORINGS 371 J.I VERTEX-COLORINGS 372 9.2
MAP-COLORINGS 386 9.3 EDGE-COLORINGS 393 9.4 FACTORIZATION 407 9.5
SUPPLEMENTARY EXERCISES 411 GLOSSARY 413 10. MEASUREMENT AND MAPPINGS
417 10.1 DISTANCE IN GRAPHS 418 10.2 DOMINATION IN GRAPHS 424 10.3
BANDWIDTH 430 10.4 INTERSECTION GRAPHS 435 10.5 LINEAR GRAPH MAPPINGS
444 10.6 MODELING NETWORK EMULATION 453 10.7 SUPPLEMENTARY EXERCISES 462
GLOSSARY 463 11. ANALYTIC GRAPH THEORY 469 11.1 RAMSEY GRAPH THEORY 470
11.2 EXTREMAL GRAPH THEORY 475 11.3 RANDOM GRAPHS 480 11.4 SUPPLEMENTARY
EXERCISES 489 GLOSSARY 490 12. SPECIAL DIGRAPH MODELS 493 12.1 DIRECTED
PATHS AND MUTUAL REACHABILITY 494 12.2 DIGRAPHS AS MODELS FOR RELATIONS
505 12.3 TOURNAMENTS 511 12.4 PROJECT SCHEDULING AND CRITICAL PATHS 516
12.5 FINDING THE STRONG COMPONENTS OF A DIGRAPH 523 12.6 SUPPLEMENTARY
EXERCISES 528 GLOSSARY 529 13. NETWORK FLOWS AND APPLICATIONS 533 13.1
FLOWS AND CUTS IN NETWORKS 534 13.2 SOLVING THE MAXIMUM-FLOW PROBLEM 542
13.3 FLOWS AND CONNECTIVITY 551 13.4 MATCHINGS, TRANSVERSALS, AND VERTEX
COVERS 560 13.5 SUPPLEMENTARY EXERCISES 573 GLOSSARY 574 14. GRAPHICAL
ENUMERATION 577 14.1 AUTOMORPHISMS OF SIMPLE GRAPHS 578 14.2 GRAPH
COLORINGS AND SYMMETRY 583 14.3 BURNSIDE S LEMMA 589 14.4 CYCLE-INDEX
POLYNOMIAL OF A PERMUTATION GROUP 595 14.5 MORE COUNTING, INCLUDING
SIMPLE GRAPHS 600 14.6 POLYA-BURNSIDE ENUMERATION 606 14.7 SUPPLEMENTARY
EXERCISES 609 GLOSSARY 610 15. ALGEBRAIC SPECIFICATION OF GRAPHS 613
15.1 CYCLIC VOLTAGES 614 15.2 CAYLEY GRAPHS AND REGULAR VOLTAGES 623
15.3 PERMUTATION VOLTAGES 632 15.4 SYMMETRIC GRAPHS AND PARALLEL
ARCHITECTURES 637 15.5 INTERCONNECTION-NETWORK PERFORMANCE 644 15.6
SUPPLEMENTARY EXERCISES 646 GLOSSARY 649 16. NONPLANAR LAYOUTS 651 16.1
REPRESENTING IMBEDDINGS BY ROTATIONS 652 16.2 GENUS DISTRIBUTION OF A
GRAPH 659 16.3 VOLTAGE-GRAPH SPECIFICATION OF GRAPH LAYOUTS 664 16.4
NON-KVL IMBEDDED VOLTAGE GRAPHS 670 16.5 HEAWOOD MAP-COLORING PROBLEM
672 16.6 SUPPLEMENTARY EXERCISES 677 GLOSSARY 678 APPENDIX 681 A.I LOGIC
FUNDAMENTALS 681 A.2 RELATIONS AND FUNCTIONS 683 A.3 SOME BASIC
COMBINATORICS 686 A.4 ALGEBRAIC STRUCTURES 687 A.5 ALGORITHMIC
COMPLEXITY 692 A.6 SUPPLEMENTARY READING 694 BIBLIOGRAPHY 695 B.I
GENERAL READING 695 B.2 REFERENCES 697 SOLUTIONS AND HINTS 709 INDEXES
757 1.1 INDEX OF APPLICATIONS 757 1.2 INDEX OF ALGORITHMS 759 1.3 INDEX
OF NOTATIONS 761 1.4 GENERAL INDEX 767
|
adam_txt |
DISCRETE MATHEMATICS AND ITS APPLICATIONS SERIES EDITOR KENNETH H. ROSEN
GRAPH THEORY AND ITS APPLICATIONS SECOND EDITION JONATHAN L GROSS
JAYYELLEN CHAPMAN & HALL/CRC TAYLOR & FRANCIS GROUP BOCA RATON LONDON
NEW YORK CONTENTS PREFACE 1. INTRODUCTION TO GRAPH MODELS 1 1.1 GRAPHS
AND DIGRAPHS 2 1.2 COMMON FAMILIES OF GRAPHS 15 1.3 GRAPH MODELING
APPLICATIONS 22 1.4 WALKS AND DISTANCE 28 1.5 PATHS, CYCLES, AND TREES
39 1.6 VERTEX AND EDGE ATTRIBUTES: MORE APPLICATIONS 48 1.7
SUPPLEMENTARY EXERCISES 51 GLOSSARY 53 2. STRUCTURE AND REPRESENTATION
57 2.1 GRAPH ISOMORPHISM 58 2.2 AUTOMORPHISMS AND SYMMETRY 65 2.3
SUBGRAPHS 72 2.4 SOME GRAPH OPERATIONS 80 2.5 TESTS FOR NON-ISOMORPHISM
89 2.6 MATRIX REPRESENTATIONS 95 2.7 MORE GRAPH OPERATIONS 101 2.8
SUPPLEMENTARY EXERCISES 107 GLOSSARY 110 3. TREES 115 3.1
CHARACTERIZATIONS AND PROPERTIES OF TREES 116 3.2 ROOTED TREES, ORDERED
TREES, AND BINARY TREES 124 3.3 BINARY-TREE TRAVERSALS 132 3.4
BINARY-SEARCH TREES 137 3.5 HUFFMAN TREES AND OPTIMAL PREFIX CODES 141
3.6 PRIORITY TREES 146 3.7 COUNTING LABELED TREES: PRIIFER ENCODING 151
3.8 COUNTING BINARY TREES: CATALAN RECURSION 156 3.9 SUPPLEMENTARY
EXERCISES 158 GLOSSARY 160 4. SPANNING TREES 163 4.1 TREE GROWING 164
4.2 DEPTH-FIRST AND BREADTH-FIRST SEARCH 171 4.3 MINIMUM SPANNING TREES
AND SHORTEST PATHS 176 4.4 APPLICATIONS OF DEPTH-FIRST SEARCH 182 4.5
CYCLES, EDGE-CUTS, AND SPANNING TREES 190 4.6 GRAPHS AND VECTOR SPACES
197 4.7 MATROIDS AND THE GREEDY ALGORITHM 207 4.8 SUPPLEMENTARY
EXERCISES 212 GLOSSARY 213 5. CONNECTIVITY 217 5.1 VERTEX- AND
EDGE-CONNECTIVITY 218 5.2 CONSTRUCTING RELIABLE NETWORKS 223 5.3 MAX-MIN
DUALITY AND MENGER'S THEOREMS 231 5.4 BLOCK DECOMPOSITIONS 241 5.5
SUPPLEMENTARY EXERCISES 244 GLOSSARY 245 6. OPTIMAL GRAPH TRAVERSALS 247
6.1 EULERIAN TRAILS AND TOURS 248 6.2 DEBRUIJN SEQUENCES AND POSTMAN
PROBLEMS 252 6.3 HAMILTONIAN PATHS AND CYCLES 267 6.4 GRAY CODES AND
TRAVELING SALESMAN PROBLEMS 273 6.5 SUPPLEMENTARY EXERCISES 282 GLOSSARY
283 7. PLANARITY AND KURATOWSKI'S THEOREM 285 7.1 PLANAR DRAWINGS AND
SOME BASIC SURFACES 286 7.2 SUBDIVISION AND HOMEOMORPHISM 292 7.3
EXTENDING PLANAR DRAWINGS 297 7.4 KURATOWSKI'S THEOREM 304 7.5 ALGEBRAIC
TESTS FOR PLANARITY 311 7.6 PLANARITY ALGORITHM 324 7.7 CROSSING NUMBERS
AND THICKNESS 327 7.8 SUPPLEMENTARY EXERCISES 331 GLOSSARY 334 8.
DRAWING GRAPHS AND MAPS 337 8.1 THE TOPOLOGY OF LOW DIMENSIONS 338 8.2
HIGHER-ORDER SURFACES 341 8.3 MATHEMATICAL MODEL FOR DRAWING GRAPHS 346
8.4 REGULAR MAPS ON A SPHERE 349 8.5 IMBEDDINGS ON HIGHER-ORDER SURFACES
354 8.6 GEOMETRIC DRAWINGS OF GRAPHS 361 8.7 SUPPLEMENTARY EXERCISES 365
GLOSSARY 366 9. GRAPH COLORINGS 371 J.I VERTEX-COLORINGS 372 9.2
MAP-COLORINGS 386 9.3 EDGE-COLORINGS 393 9.4 FACTORIZATION 407 9.5
SUPPLEMENTARY EXERCISES 411 GLOSSARY 413 10. MEASUREMENT AND MAPPINGS
417 10.1 DISTANCE IN GRAPHS 418 10.2 DOMINATION IN GRAPHS 424 10.3
BANDWIDTH 430 10.4 INTERSECTION GRAPHS 435 10.5 LINEAR GRAPH MAPPINGS
444 10.6 MODELING NETWORK EMULATION 453 10.7 SUPPLEMENTARY EXERCISES 462
GLOSSARY 463 11. ANALYTIC GRAPH THEORY 469 11.1 RAMSEY GRAPH THEORY 470
11.2 EXTREMAL GRAPH THEORY 475 11.3 RANDOM GRAPHS 480 11.4 SUPPLEMENTARY
EXERCISES 489 GLOSSARY 490 12. SPECIAL DIGRAPH MODELS 493 12.1 DIRECTED
PATHS AND MUTUAL REACHABILITY 494 12.2 DIGRAPHS AS MODELS FOR RELATIONS
505 12.3 TOURNAMENTS 511 12.4 PROJECT SCHEDULING AND CRITICAL PATHS 516
12.5 FINDING THE STRONG COMPONENTS OF A DIGRAPH 523 12.6 SUPPLEMENTARY
EXERCISES 528 GLOSSARY 529 13. NETWORK FLOWS AND APPLICATIONS 533 13.1
FLOWS AND CUTS IN NETWORKS 534 13.2 SOLVING THE MAXIMUM-FLOW PROBLEM 542
13.3 FLOWS AND CONNECTIVITY 551 13.4 MATCHINGS, TRANSVERSALS, AND VERTEX
COVERS 560 13.5 SUPPLEMENTARY EXERCISES 573 GLOSSARY 574 14. GRAPHICAL
ENUMERATION 577 14.1 AUTOMORPHISMS OF SIMPLE GRAPHS 578 14.2 GRAPH
COLORINGS AND SYMMETRY 583 14.3 BURNSIDE'S LEMMA 589 14.4 CYCLE-INDEX
POLYNOMIAL OF A PERMUTATION GROUP 595 14.5 MORE COUNTING, INCLUDING
SIMPLE GRAPHS 600 14.6 POLYA-BURNSIDE ENUMERATION 606 14.7 SUPPLEMENTARY
EXERCISES 609 GLOSSARY 610 15. ALGEBRAIC SPECIFICATION OF GRAPHS 613
15.1 CYCLIC VOLTAGES 614 15.2 CAYLEY GRAPHS AND REGULAR VOLTAGES 623
15.3 PERMUTATION VOLTAGES 632 15.4 SYMMETRIC GRAPHS AND PARALLEL
ARCHITECTURES 637 15.5 INTERCONNECTION-NETWORK PERFORMANCE 644 15.6
SUPPLEMENTARY EXERCISES 646 GLOSSARY 649 16. NONPLANAR LAYOUTS 651 16.1
REPRESENTING IMBEDDINGS BY ROTATIONS 652 16.2 GENUS DISTRIBUTION OF A
GRAPH 659 16.3 VOLTAGE-GRAPH SPECIFICATION OF GRAPH LAYOUTS 664 16.4
NON-KVL IMBEDDED VOLTAGE GRAPHS 670 16.5 HEAWOOD MAP-COLORING PROBLEM
672 16.6 SUPPLEMENTARY EXERCISES 677 GLOSSARY 678 APPENDIX 681 A.I LOGIC
FUNDAMENTALS 681 A.2 RELATIONS AND FUNCTIONS 683 A.3 SOME BASIC
COMBINATORICS 686 A.4 ALGEBRAIC STRUCTURES 687 A.5 ALGORITHMIC
COMPLEXITY 692 A.6 SUPPLEMENTARY READING 694 BIBLIOGRAPHY 695 B.I
GENERAL READING 695 B.2 REFERENCES 697 SOLUTIONS AND HINTS 709 INDEXES
757 1.1 INDEX OF APPLICATIONS 757 1.2 INDEX OF ALGORITHMS 759 1.3 INDEX
OF NOTATIONS 761 1.4 GENERAL INDEX 767 |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author | Gross, Jonathan L. 1941- Yellen, Jay |
author_GND | (DE-588)124283926 (DE-588)141942878 |
author_facet | Gross, Jonathan L. 1941- Yellen, Jay |
author_role | aut aut |
author_sort | Gross, Jonathan L. 1941- |
author_variant | j l g jl jlg j y jy |
building | Verbundindex |
bvnumber | BV022951430 |
callnumber-first | Q - Science |
callnumber-label | QA166 |
callnumber-raw | QA166 |
callnumber-search | QA166 |
callnumber-sort | QA 3166 |
callnumber-subject | QA - Mathematics |
classification_rvk | SK 890 |
classification_tum | MAT 055f |
ctrlnum | (OCoLC)61458362 (DE-599)BVBBV022951430 |
dewey-full | 511/.5 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511/.5 |
dewey-search | 511/.5 |
dewey-sort | 3511 15 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
discipline_str_mv | Mathematik |
edition | Second edition |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02034nam a2200505zc 4500</leader><controlfield tag="001">BV022951430</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210318 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">071108s2006 xxuad|| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">158488505X</subfield><subfield code="c">acidfree paper</subfield><subfield code="9">1-58488-505-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781584885054</subfield><subfield code="9">978-1-58488-505-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)61458362</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022951430</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</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">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-92</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-1050</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</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">05Cxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gross, Jonathan L.</subfield><subfield code="d">1941-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124283926</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph theory and its applications</subfield><subfield code="c">Jonathan L. Gross, Jay Yellen</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Second edition</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton, Fla. [u.a.]</subfield><subfield code="b">Chapman & Hall/CRC</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">779 Seiten</subfield><subfield code="b">Ill., 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="490" ind1="0" ind2=" "><subfield code="a">Discrete Mathematics and its Applications</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (S. 695-708) and indexes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matemática discreta</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Teoria dos grafos</subfield><subfield code="2">larpcal</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">Yellen, Jay</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)141942878</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/toc/fy0602/2005052906.html</subfield><subfield code="3">Table of contents only</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0647/2005052906-d.html</subfield><subfield code="3">Publisher description</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Darmstadt</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=016155893&sequence=000001&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-016155893</subfield></datafield></record></collection> |
id | DE-604.BV022951430 |
illustrated | Illustrated |
index_date | 2024-07-02T19:02:27Z |
indexdate | 2024-07-09T21:08:26Z |
institution | BVB |
isbn | 158488505X 9781584885054 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016155893 |
oclc_num | 61458362 |
open_access_boolean | |
owner | DE-92 DE-634 DE-521 DE-91G DE-BY-TUM DE-83 DE-188 DE-1050 |
owner_facet | DE-92 DE-634 DE-521 DE-91G DE-BY-TUM DE-83 DE-188 DE-1050 |
physical | 779 Seiten Ill., graph. Darst. |
publishDate | 2006 |
publishDateSearch | 2006 |
publishDateSort | 2006 |
publisher | Chapman & Hall/CRC |
record_format | marc |
series2 | Discrete Mathematics and its Applications |
spelling | Gross, Jonathan L. 1941- Verfasser (DE-588)124283926 aut Graph theory and its applications Jonathan L. Gross, Jay Yellen Second edition Boca Raton, Fla. [u.a.] Chapman & Hall/CRC 2006 779 Seiten Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Discrete Mathematics and its Applications Includes bibliographical references (S. 695-708) and indexes Graphes, Théorie des Matemática discreta larpcal Teoria dos grafos larpcal Graph theory Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s DE-604 Yellen, Jay Verfasser (DE-588)141942878 aut http://www.loc.gov/catdir/toc/fy0602/2005052906.html Table of contents only http://www.loc.gov/catdir/enhancements/fy0647/2005052906-d.html Publisher description HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016155893&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Gross, Jonathan L. 1941- Yellen, Jay Graph theory and its applications Graphes, Théorie des Matemática discreta larpcal Teoria dos grafos larpcal Graph theory Graphentheorie (DE-588)4113782-6 gnd |
subject_GND | (DE-588)4113782-6 |
title | Graph theory and its applications |
title_auth | Graph theory and its applications |
title_exact_search | Graph theory and its applications |
title_exact_search_txtP | Graph theory and its applications |
title_full | Graph theory and its applications Jonathan L. Gross, Jay Yellen |
title_fullStr | Graph theory and its applications Jonathan L. Gross, Jay Yellen |
title_full_unstemmed | Graph theory and its applications Jonathan L. Gross, Jay Yellen |
title_short | Graph theory and its applications |
title_sort | graph theory and its applications |
topic | Graphes, Théorie des Matemática discreta larpcal Teoria dos grafos larpcal Graph theory Graphentheorie (DE-588)4113782-6 gnd |
topic_facet | Graphes, Théorie des Matemática discreta Teoria dos grafos Graph theory Graphentheorie |
url | http://www.loc.gov/catdir/toc/fy0602/2005052906.html http://www.loc.gov/catdir/enhancements/fy0647/2005052906-d.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016155893&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT grossjonathanl graphtheoryanditsapplications AT yellenjay graphtheoryanditsapplications |