Exercises in Graph Theory:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Dordrecht
Springer Netherlands
1998
|
| Series: | Kluwer Texts in the Mathematical Sciences, A Graduate-Level Book Series
19 |
| Subjects: | |
| Online Access: | Volltext |
| Item Description: | This book supplements the textbook of the authors" Lectures on Graph The ory" [6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord ing to the topics of graph theory: paths, cycles, components, subgraphs, re constructibility, operations on graphs, graphs and matrices, trees, independence, matchings, coverings, connectivity, matroids, planarity, Eulerian and Hamiltonian graphs, degree sequences, colorings, digraphs, hypergraphs. Each section starts with main definitions and brief theoretical discussions. They constitute a minimal background, just a reminder, for solving the exercises. the presented facts and a more extended exposition may be found in Proofs of the mentioned textbook of the authors, as well as in many other books in graph theory. Most exercises are supplied with answers and hints. In many cases complete solutions are given. At the end of the book you may find the index of terms and the glossary of notations. The "Bibliography" list refers only to the books used by the authors during the preparation of the exercisebook. Clearly, it mentions only a fraction of available books in graph theory. The invention of the authors was also driven by numerous journal articles, which are impossible to list here |
| Physical Description: | 1 Online-Ressource (VIII, 356 p) |
| ISBN: | 9789401715140 9789048149797 |
| ISSN: | 0927-4529 |
| DOI: | 10.1007/978-94-017-1514-0 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042424252 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1998 |||| o||u| ||||||eng d | ||
| 020 | |a 9789401715140 |c Online |9 978-94-017-1514-0 | ||
| 020 | |a 9789048149797 |c Print |9 978-90-481-4979-7 | ||
| 024 | 7 | |a 10.1007/978-94-017-1514-0 |2 doi | |
| 035 | |a (OCoLC)1184505882 | ||
| 035 | |a (DE-599)BVBBV042424252 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 621.3815 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Melnikov, O. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Exercises in Graph Theory |c by O. Melnikov, V. Sarvanov, R. Tyshkevich, V. Yemelichev, I. Zverovich |
| 264 | 1 | |a Dordrecht |b Springer Netherlands |c 1998 | |
| 300 | |a 1 Online-Ressource (VIII, 356 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Kluwer Texts in the Mathematical Sciences, A Graduate-Level Book Series |v 19 |x 0927-4529 | |
| 500 | |a This book supplements the textbook of the authors" Lectures on Graph The ory" [6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord ing to the topics of graph theory: paths, cycles, components, subgraphs, re constructibility, operations on graphs, graphs and matrices, trees, independence, matchings, coverings, connectivity, matroids, planarity, Eulerian and Hamiltonian graphs, degree sequences, colorings, digraphs, hypergraphs. Each section starts with main definitions and brief theoretical discussions. They constitute a minimal background, just a reminder, for solving the exercises. the presented facts and a more extended exposition may be found in Proofs of the mentioned textbook of the authors, as well as in many other books in graph theory. Most exercises are supplied with answers and hints. In many cases complete solutions are given. At the end of the book you may find the index of terms and the glossary of notations. The "Bibliography" list refers only to the books used by the authors during the preparation of the exercisebook. Clearly, it mentions only a fraction of available books in graph theory. The invention of the authors was also driven by numerous journal articles, which are impossible to list here | ||
| 650 | 4 | |a Engineering | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Computer engineering | |
| 650 | 4 | |a Systems engineering | |
| 650 | 4 | |a Circuits and Systems | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Electrical Engineering | |
| 650 | 4 | |a Optimization | |
| 650 | 4 | |a Ingenieurwissenschaften | |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4143389-0 |a Aufgabensammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Sarvanov, V. |e Sonstige |4 oth | |
| 700 | 1 | |a Tyshkevich, R. |e Sonstige |4 oth | |
| 700 | 1 | |a Yemelichev, V. |e Sonstige |4 oth | |
| 700 | 1 | |a Zverovich, I. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-94-017-1514-0 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027859669 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804153101009027072 |
|---|---|
| any_adam_object | |
| author | Melnikov, O. |
| author_facet | Melnikov, O. |
| author_role | aut |
| author_sort | Melnikov, O. |
| author_variant | o m om |
| building | Verbundindex |
| bvnumber | BV042424252 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1184505882 (DE-599)BVBBV042424252 |
| dewey-full | 621.3815 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 621 - Applied physics |
| dewey-raw | 621.3815 |
| dewey-search | 621.3815 |
| dewey-sort | 3621.3815 |
| dewey-tens | 620 - Engineering and allied operations |
| discipline | Mathematik Elektrotechnik / Elektronik / Nachrichtentechnik |
| doi_str_mv | 10.1007/978-94-017-1514-0 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03777nmm a2200613zcb4500</leader><controlfield tag="001">BV042424252</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1998 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789401715140</subfield><subfield code="c">Online</subfield><subfield code="9">978-94-017-1514-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789048149797</subfield><subfield code="c">Print</subfield><subfield code="9">978-90-481-4979-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-94-017-1514-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184505882</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042424252</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="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">621.3815</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Melnikov, O.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Exercises in Graph Theory</subfield><subfield code="c">by O. Melnikov, V. Sarvanov, R. Tyshkevich, V. Yemelichev, I. Zverovich</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht</subfield><subfield code="b">Springer Netherlands</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VIII, 356 p)</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="0" ind2=" "><subfield code="a">Kluwer Texts in the Mathematical Sciences, A Graduate-Level Book Series</subfield><subfield code="v">19</subfield><subfield code="x">0927-4529</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">This book supplements the textbook of the authors" Lectures on Graph The ory" [6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord ing to the topics of graph theory: paths, cycles, components, subgraphs, re constructibility, operations on graphs, graphs and matrices, trees, independence, matchings, coverings, connectivity, matroids, planarity, Eulerian and Hamiltonian graphs, degree sequences, colorings, digraphs, hypergraphs. Each section starts with main definitions and brief theoretical discussions. They constitute a minimal background, just a reminder, for solving the exercises. the presented facts and a more extended exposition may be found in Proofs of the mentioned textbook of the authors, as well as in many other books in graph theory. Most exercises are supplied with answers and hints. In many cases complete solutions are given. At the end of the book you may find the index of terms and the glossary of notations. The "Bibliography" list refers only to the books used by the authors during the preparation of the exercisebook. Clearly, it mentions only a fraction of available books in graph theory. The invention of the authors was also driven by numerous journal articles, which are impossible to list here</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systems engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Circuits and Systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ingenieurwissenschaften</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="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4143389-0</subfield><subfield code="a">Aufgabensammlung</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="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sarvanov, V.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tyshkevich, R.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yemelichev, V.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zverovich, I.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-94-017-1514-0</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027859669</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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> |
| genre | 1\p (DE-588)4143389-0 Aufgabensammlung gnd-content |
| genre_facet | Aufgabensammlung |
| id | DE-604.BV042424252 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:15Z |
| institution | BVB |
| isbn | 9789401715140 9789048149797 |
| issn | 0927-4529 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027859669 |
| oclc_num | 1184505882 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (VIII, 356 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Springer Netherlands |
| record_format | marc |
| series2 | Kluwer Texts in the Mathematical Sciences, A Graduate-Level Book Series |
| spelling | Melnikov, O. Verfasser aut Exercises in Graph Theory by O. Melnikov, V. Sarvanov, R. Tyshkevich, V. Yemelichev, I. Zverovich Dordrecht Springer Netherlands 1998 1 Online-Ressource (VIII, 356 p) txt rdacontent c rdamedia cr rdacarrier Kluwer Texts in the Mathematical Sciences, A Graduate-Level Book Series 19 0927-4529 This book supplements the textbook of the authors" Lectures on Graph The ory" [6] by more than thousand exercises of varying complexity. The books match each other in their contents, notations, and terminology. The authors hope that both students and lecturers will find this book helpful for mastering and verifying the understanding of the peculiarities of graphs. The exercises are grouped into eleven chapters and numerous sections accord ing to the topics of graph theory: paths, cycles, components, subgraphs, re constructibility, operations on graphs, graphs and matrices, trees, independence, matchings, coverings, connectivity, matroids, planarity, Eulerian and Hamiltonian graphs, degree sequences, colorings, digraphs, hypergraphs. Each section starts with main definitions and brief theoretical discussions. They constitute a minimal background, just a reminder, for solving the exercises. the presented facts and a more extended exposition may be found in Proofs of the mentioned textbook of the authors, as well as in many other books in graph theory. Most exercises are supplied with answers and hints. In many cases complete solutions are given. At the end of the book you may find the index of terms and the glossary of notations. The "Bibliography" list refers only to the books used by the authors during the preparation of the exercisebook. Clearly, it mentions only a fraction of available books in graph theory. The invention of the authors was also driven by numerous journal articles, which are impossible to list here Engineering Computational complexity Combinatorics Mathematical optimization Computer engineering Systems engineering Circuits and Systems Discrete Mathematics in Computer Science Electrical Engineering Optimization Ingenieurwissenschaften Graphentheorie (DE-588)4113782-6 gnd rswk-swf 1\p (DE-588)4143389-0 Aufgabensammlung gnd-content Graphentheorie (DE-588)4113782-6 s 2\p DE-604 Sarvanov, V. Sonstige oth Tyshkevich, R. Sonstige oth Yemelichev, V. Sonstige oth Zverovich, I. Sonstige oth https://doi.org/10.1007/978-94-017-1514-0 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Melnikov, O. Exercises in Graph Theory Engineering Computational complexity Combinatorics Mathematical optimization Computer engineering Systems engineering Circuits and Systems Discrete Mathematics in Computer Science Electrical Engineering Optimization Ingenieurwissenschaften Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4113782-6 (DE-588)4143389-0 |
| title | Exercises in Graph Theory |
| title_auth | Exercises in Graph Theory |
| title_exact_search | Exercises in Graph Theory |
| title_full | Exercises in Graph Theory by O. Melnikov, V. Sarvanov, R. Tyshkevich, V. Yemelichev, I. Zverovich |
| title_fullStr | Exercises in Graph Theory by O. Melnikov, V. Sarvanov, R. Tyshkevich, V. Yemelichev, I. Zverovich |
| title_full_unstemmed | Exercises in Graph Theory by O. Melnikov, V. Sarvanov, R. Tyshkevich, V. Yemelichev, I. Zverovich |
| title_short | Exercises in Graph Theory |
| title_sort | exercises in graph theory |
| topic | Engineering Computational complexity Combinatorics Mathematical optimization Computer engineering Systems engineering Circuits and Systems Discrete Mathematics in Computer Science Electrical Engineering Optimization Ingenieurwissenschaften Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Engineering Computational complexity Combinatorics Mathematical optimization Computer engineering Systems engineering Circuits and Systems Discrete Mathematics in Computer Science Electrical Engineering Optimization Ingenieurwissenschaften Graphentheorie Aufgabensammlung |
| url | https://doi.org/10.1007/978-94-017-1514-0 |
| work_keys_str_mv | AT melnikovo exercisesingraphtheory AT sarvanovv exercisesingraphtheory AT tyshkevichr exercisesingraphtheory AT yemelichevv exercisesingraphtheory AT zverovichi exercisesingraphtheory |