Verfügbarkeit: Graph theory :: THWS Bibkatalog

Graph theory:

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Diestel, Reinhard 1959- (VerfasserIn)
Format:	Buch
Sprache:	English German
Veröffentlicht:	Berlin [u.a.] Springer 2006
Ausgabe:	3. ed.
Schriftenreihe:	Graduate texts in mathematics 173
Schlagworte:	Graphes, Théorie des Graph theory Graphentheorie Lehrbuch
Online-Zugang:	Graph theory Graph theory Inhaltsverzeichnis
Beschreibung:	XVI, 410 S. Ill., graph. Darst.
ISBN:	9783540261834 3540261834

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV023271257
003	DE-604
005	20080423
007	t
008	080422s2006 ad\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 9783540261834 \|9 978-3-540-26183-4
020			\|a 3540261834 \|9 3-540-26183-4
035			\|a (OCoLC)61167989
035			\|a (DE-599)BVBBV023271257
040			\|a DE-604 \|b ger \|e rakwb
041	1		\|a eng \|h ger
049			\|a DE-91G \|a DE-11
050		0	\|a QA166
082	0		\|a 511/.5 \|2 22
084			\|a SK 890 \|0 (DE-625)143267: \|2 rvk
084			\|a MAT 055f \|2 stub
100	1		\|a Diestel, Reinhard \|d 1959- \|e Verfasser \|0 (DE-588)122411986 \|4 aut
240	1	0	\|a Graphentheorie
245	1	0	\|a Graph theory \|c Reinhard Diestel
250			\|a 3. ed.
264		1	\|a Berlin [u.a.] \|b Springer \|c 2006
300			\|a XVI, 410 S. \|b Ill., graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Graduate texts in mathematics \|v 173
546			\|a Aus dem Dt. übers.
650		4	\|a Graphes, Théorie des
650		4	\|a Graph theory
650	0	7	\|a Graphentheorie \|0 (DE-588)4113782-6 \|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		\|5 DE-604
830		0	\|a Graduate texts in mathematics \|v 173 \|w (DE-604)BV000000067 \|9 173
856	4		\|u http://digitool.hbz-nrw.de:1801/webclient/DeliveryManager?pid=1515703&custom_att_2=simple_viewer \|x Verlagsdaten Springer \|y Graph theory
856	4		\|u http://digitool.hbz-nrw.de:1801/webclient/DeliveryManager?pid=1670637&custom_att_2=simple_viewer \|y Graph theory \|3 Inhaltsverzeichnis
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=016456262&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-016456262

Datensatz im Suchindex

_version_	1804137585197449216
adam_text	REINHARD DIESTEL GRAPH THEORY THIRD EDITION WITH 146 ILLUSTRATIONS 4Y SPRINGER CONTENTS PREFACE VII 1. THE BASICS 1 1.1 GRAPHS* 2 1.2 THE DEGREE OF A VERTEX* 5 1.3 PATHS AND CYCLES* 6 1.4 CONNECTIVITY* 10 1.5 TREES AND FORESTS* 13 1.6 BIPARTITE GRAPHS* 17 1.7 CONTRACTION AND MINORS* 18 1.8 EULER TOURS* 22 1.9 SOME LINEAR ALGEBRA 23 1.10 OTHER NOTIONS OF GRAPHS 28 EXERCISES 30 NOTES 32 2. MATCHING, COVERING AND PACKING 33 2.1 MATCHING IN BIPARTITE GRAPHS* 34 2.2 MATCHING IN GENERAL GRAPHS -* 39 2.3 PACKING AND COVERING 44 2.4 TREE-PACKING AND ARBORICITY 46 2.5 PATH COVERS 49 EXERCISES 51 NOTES 53 * SECTIONS MARKED BY AN ASTERISK ARE RECOMMENDED FOR A FIRST COURSE. OF SECTIONS MARKED (* , THE BEGINNING IS RECOMMENDED FOR A FIRST COURSE. XIV CONTENTS 3. CONNECTIVITY 55 3.1 2-CONNECTED GRAPHS AND SUBGRAPHS* 55 3.2 THE STRUCTURE OF 3-CONNECTED GRAPHS * 57 3.3 MENGER S THEOREM* 62 3.4 MADER S THEOREM 67 3.5 LINKING PAIRS OF VERTICES * 69 EXERCISES 78 NOTES ., 80 4. PLANAR GRAPHS 83 4.1 TOPOLOGICAL PREREQUISITES* 84 4.2 PLANE GRAPHS* 86 4.3 DRAWINGS 92 4.4 PLANAR GRAPHS: KURATOWSKI S THEOREM* 96 4.5 ALGEBRAIC PLANARITY CRITERIA 101 4.6 PLANE DUALITY 103 EXERCISES 106 NOTES 109 5. COLOURING ILL 5.1 COLOURING MAPS AND PLANAR GRAPHS* 112 5.2 COLOURING VERTICES* 114 5.3 COLOURING EDGES* 119 5.4 LIST COLOURING 121 5.5 PERFECT GRAPHS 126 EXERCISES 133 NOTES 136 6. FLOWS 139 6.1 CIRCULATIONS** 140 6.2 FLOWS IN NETWORKS* 141 6.3 GROUP-VALUED FLOWS 144 6.4 FC-FLOWS FOR SMALL K 149 6.5 FLOW-COLOURING DUALITY 152 6.6 TUTTE S FLOW CONJECTURES 156 EXERCISES 160 NOTES 161 CONTENTS XV 7. EXTREMAL GRAPH THEORY 163 7.1 SUBGRAPHS* 164 7.2 MINORS** 169 7.3 HADWIGER S CONJECTURE* 172 7.4 SZEMEREDI S REGULARITY LEMMA 175 7.5 APPLYING THE REGULARITY LEMMA 183 EXERCISES 189 NOTES 192 8. INFINITE GRAPHS 195 8.1 BASIC NOTIONS, FACTS AND TECHNIQUES* 196 8.2 PATHS, TREES, AND ENDS * 204 8.3 HOMOGENEOUS AND UNIVERSAL GRAPHS* 212 8.4 CONNECTIVITY AND MATCHING 216 8.5 THE TOPOLOGICAL END SPACE 226 EXERCISES 237 NOTES 244 9. RAMSEY THEORY FOR GRAPHS 251 9.1 RAMSEY S ORIGINAL THEOREMS* 252 9.2 RAMSEY NUMBERS * 255 9.3 INDUCED RAMSEY THEOREMS 258 9.4 RAMSEY PROPERTIES AND CONNECTIVITY * 268 EXERCISES 271 NOTES 272 10. HAMILTON CYCLES 275 10.1 SIMPLE SUFFICIENT CONDITIONS* 275 10.2 HAMILTON CYCLES AND DEGREE SEQUENCES* 278 10.3 HAMILTON CYCLES IN THE SQUARE OF A GRAPH 281 EXERCISES 289 NOTES 290 XVI CONTENTS 11. RANDOM GRAPHS 293 11.1 THE NOTION OF A RANDOM GRAPH* 294 11.2 THE PROBABILISTIC METHOD* 299 11.3 PROPERTIES OF ALMOST ALL GRAPHS* 302 11.4 THRESHOLD FUNCTIONS AND SECOND MOMENTS 306 EXERCISES 312 NOTES 313 12. MINORS, TREES AND WQO 315 12.1 WELL-QUASI-ORDERING* 316 12.2 THE GRAPH MINOR THEOREM FOR TREES* 317 12.3 TREE-DECOMPOSITIONS 319 12.4 TREE-WIDTH AND FORBIDDEN MINORS 327 12.5 THE GRAPH MINOR THEOREM * 341 EXERCISES 350 NOTES 354 A. INFINITE SETS 357 B. SURFACES 361 HINTS FOR ALL THE EXERCISES 369 INDEX 393 SYMBOL INDEX 409
adam_txt	REINHARD DIESTEL GRAPH THEORY THIRD EDITION WITH 146 ILLUSTRATIONS 4Y SPRINGER CONTENTS PREFACE VII 1. THE BASICS 1 1.1 GRAPHS* 2 1.2 THE DEGREE OF A VERTEX* 5 1.3 PATHS AND CYCLES* 6 1.4 CONNECTIVITY* 10 1.5 TREES AND FORESTS* 13 1.6 BIPARTITE GRAPHS* 17 1.7 CONTRACTION AND MINORS* 18 1.8 EULER TOURS* 22 1.9 SOME LINEAR ALGEBRA 23 1.10 OTHER NOTIONS OF GRAPHS 28 EXERCISES 30 NOTES 32 2. MATCHING, COVERING AND PACKING 33 2.1 MATCHING IN BIPARTITE GRAPHS* 34 2.2 MATCHING IN GENERAL GRAPHS'-' 39 2.3 PACKING AND COVERING 44 2.4 TREE-PACKING AND ARBORICITY 46 2.5 PATH COVERS 49 EXERCISES 51 NOTES 53 SECTIONS MARKED BY AN ASTERISK ARE RECOMMENDED FOR A FIRST COURSE. OF SECTIONS MARKED (', THE BEGINNING IS RECOMMENDED FOR A FIRST COURSE. XIV CONTENTS 3. CONNECTIVITY 55 3.1 2-CONNECTED GRAPHS AND SUBGRAPHS 55 3.2 THE STRUCTURE OF 3-CONNECTED GRAPHS'' 57 3.3 MENGER'S THEOREM 62 3.4 MADER'S THEOREM 67 3.5 LINKING PAIRS OF VERTICES'' 69 EXERCISES 78 NOTES ., 80 4. PLANAR GRAPHS 83 4.1 TOPOLOGICAL PREREQUISITES 84 4.2 PLANE GRAPHS* 86 4.3 DRAWINGS 92 4.4 PLANAR GRAPHS: KURATOWSKI'S THEOREM* 96 4.5 ALGEBRAIC PLANARITY CRITERIA 101 4.6 PLANE DUALITY 103 EXERCISES 106 NOTES 109 5. COLOURING ILL 5.1 COLOURING MAPS AND PLANAR GRAPHS* 112 5.2 COLOURING VERTICES* 114 5.3 COLOURING EDGES* 119 5.4 LIST COLOURING 121 5.5 PERFECT GRAPHS 126 EXERCISES 133 NOTES 136 6. FLOWS 139 6.1 CIRCULATIONS*' 140 6.2 FLOWS IN NETWORKS 141 6.3 GROUP-VALUED FLOWS 144 6.4 FC-FLOWS FOR SMALL K 149 6.5 FLOW-COLOURING DUALITY 152 6.6 TUTTE'S FLOW CONJECTURES 156 EXERCISES 160 NOTES 161 CONTENTS XV 7. EXTREMAL GRAPH THEORY 163 7.1 SUBGRAPHS* 164 7.2 MINORS*' 169 7.3 HADWIGER'S CONJECTURE 172 7.4 SZEMEREDI'S REGULARITY LEMMA 175 7.5 APPLYING THE REGULARITY LEMMA 183 EXERCISES 189 NOTES 192 8. INFINITE GRAPHS 195 8.1 BASIC NOTIONS, FACTS AND TECHNIQUES* 196 8.2 PATHS, TREES, AND ENDS'' 204 8.3 HOMOGENEOUS AND UNIVERSAL GRAPHS 212 8.4 CONNECTIVITY AND MATCHING 216 8.5 THE TOPOLOGICAL END SPACE 226 EXERCISES 237 NOTES 244 9. RAMSEY THEORY FOR GRAPHS 251 9.1 RAMSEY'S ORIGINAL THEOREMS* 252 9.2 RAMSEY NUMBERS'' 255 9.3 INDUCED RAMSEY THEOREMS 258 9.4 RAMSEY PROPERTIES AND CONNECTIVITY'' 268 EXERCISES 271 NOTES 272 10. HAMILTON CYCLES 275 10.1 SIMPLE SUFFICIENT CONDITIONS* 275 10.2 HAMILTON CYCLES AND DEGREE SEQUENCES* 278 10.3 HAMILTON CYCLES IN THE SQUARE OF A GRAPH 281 EXERCISES 289 NOTES 290 XVI CONTENTS 11. RANDOM GRAPHS 293 11.1 THE NOTION OF A RANDOM GRAPH* 294 11.2 THE PROBABILISTIC METHOD* 299 11.3 PROPERTIES OF ALMOST ALL GRAPHS* 302 11.4 THRESHOLD FUNCTIONS AND SECOND MOMENTS 306 EXERCISES 312 NOTES 313 12. MINORS, TREES AND WQO 315 12.1 WELL-QUASI-ORDERING* 316 12.2 THE GRAPH MINOR THEOREM FOR TREES* 317 12.3 TREE-DECOMPOSITIONS 319 12.4 TREE-WIDTH AND FORBIDDEN MINORS 327 12.5 THE GRAPH MINOR THEOREM'*' 341 EXERCISES 350 NOTES 354 A. INFINITE SETS 357 B. SURFACES 361 HINTS FOR ALL THE EXERCISES 369 INDEX 393 SYMBOL INDEX 409
any_adam_object	1
any_adam_object_boolean	1
author	Diestel, Reinhard 1959-
author_GND	(DE-588)122411986
author_facet	Diestel, Reinhard 1959-
author_role	aut
author_sort	Diestel, Reinhard 1959-
author_variant	r d rd
building	Verbundindex
bvnumber	BV023271257
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)61167989 (DE-599)BVBBV023271257
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	3. ed.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01941nam a2200481 cb4500</leader><controlfield tag="001">BV023271257</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080423 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080422s2006 ad\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540261834</subfield><subfield code="9">978-3-540-26183-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540261834</subfield><subfield code="9">3-540-26183-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)61167989</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023271257</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="1" ind2=" "><subfield code="a">eng</subfield><subfield code="h">ger</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</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><subfield code="2">22</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="100" ind1="1" ind2=" "><subfield code="a">Diestel, Reinhard</subfield><subfield code="d">1959-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122411986</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Graphentheorie</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph theory</subfield><subfield code="c">Reinhard Diestel</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2006</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 410 S.</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="1" ind2=" "><subfield code="a">Graduate texts in mathematics</subfield><subfield code="v">173</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">Aus dem Dt. übers.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des</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="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="830" ind1=" " ind2="0"><subfield code="a">Graduate texts in mathematics</subfield><subfield code="v">173</subfield><subfield code="w">(DE-604)BV000000067</subfield><subfield code="9">173</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://digitool.hbz-nrw.de:1801/webclient/DeliveryManager?pid=1515703&custom_att_2=simple_viewer</subfield><subfield code="x">Verlagsdaten Springer</subfield><subfield code="y">Graph theory</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://digitool.hbz-nrw.de:1801/webclient/DeliveryManager?pid=1670637&custom_att_2=simple_viewer</subfield><subfield code="y">Graph theory</subfield><subfield code="3">Inhaltsverzeichnis</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=016456262&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-016456262</subfield></datafield></record></collection>
genre	(DE-588)4123623-3 Lehrbuch gnd-content
genre_facet	Lehrbuch
id	DE-604.BV023271257
illustrated	Illustrated
index_date	2024-07-02T20:36:00Z
indexdate	2024-07-09T21:14:38Z
institution	BVB
isbn	9783540261834 3540261834
language	English German
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-016456262
oclc_num	61167989
open_access_boolean
owner	DE-91G DE-BY-TUM DE-11
owner_facet	DE-91G DE-BY-TUM DE-11
physical	XVI, 410 S. Ill., graph. Darst.
publishDate	2006
publishDateSearch	2006
publishDateSort	2006
publisher	Springer
record_format	marc
series	Graduate texts in mathematics
series2	Graduate texts in mathematics
spelling	Diestel, Reinhard 1959- Verfasser (DE-588)122411986 aut Graphentheorie Graph theory Reinhard Diestel 3. ed. Berlin [u.a.] Springer 2006 XVI, 410 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Graduate texts in mathematics 173 Aus dem Dt. übers. Graphes, Théorie des Graph theory Graphentheorie (DE-588)4113782-6 gnd rswk-swf (DE-588)4123623-3 Lehrbuch gnd-content Graphentheorie (DE-588)4113782-6 s DE-604 Graduate texts in mathematics 173 (DE-604)BV000000067 173 http://digitool.hbz-nrw.de:1801/webclient/DeliveryManager?pid=1515703&custom_att_2=simple_viewer Verlagsdaten Springer Graph theory http://digitool.hbz-nrw.de:1801/webclient/DeliveryManager?pid=1670637&custom_att_2=simple_viewer Graph theory Inhaltsverzeichnis HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016456262&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Diestel, Reinhard 1959- Graph theory Graduate texts in mathematics Graphes, Théorie des Graph theory Graphentheorie (DE-588)4113782-6 gnd
subject_GND	(DE-588)4113782-6 (DE-588)4123623-3
title	Graph theory
title_alt	Graphentheorie
title_auth	Graph theory
title_exact_search	Graph theory
title_exact_search_txtP	Graph theory
title_full	Graph theory Reinhard Diestel
title_fullStr	Graph theory Reinhard Diestel
title_full_unstemmed	Graph theory Reinhard Diestel
title_short	Graph theory
title_sort	graph theory
topic	Graphes, Théorie des Graph theory Graphentheorie (DE-588)4113782-6 gnd
topic_facet	Graphes, Théorie des Graph theory Graphentheorie Lehrbuch
url	http://digitool.hbz-nrw.de:1801/webclient/DeliveryManager?pid=1515703&custom_att_2=simple_viewer http://digitool.hbz-nrw.de:1801/webclient/DeliveryManager?pid=1670637&custom_att_2=simple_viewer http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016456262&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000067
work_keys_str_mv	AT diestelreinhard graphentheorie AT diestelreinhard graphtheory

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Inhaltsverzeichnis

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge