Verfügbarkeit: Graphs and hypergraphs

Graphs and hypergraphs:

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Berge, Claude 1926-2002 (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam (u.a.) North-Holland Publ. Co. (u.a.) 1976
Ausgabe:	2., rev. ed.
Schriftenreihe:	North-Holland mathematical library. 6
Schlagworte:	Grafentheorie Graphes, Théorie des Hypergraphes Graph theory Hypergraphs Graphentheorie Graph Hypergraph Einführung
Online-Zugang:	Inhaltsverzeichnis
Beschreibung:	XIV, 528 S. graph.Darst.
ISBN:	0720424534

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV001983162
003	DE-604
005	20140623
007	t
008	890928s1976 d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0720424534 \|9 0-7204-2453-4
035			\|a (OCoLC)2107701
035			\|a (DE-599)BVBBV001983162
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-91G \|a DE-703 \|a DE-739 \|a DE-706 \|a DE-83 \|a DE-11 \|a DE-188 \|a DE-384 \|a DE-12
050		0	\|a QA166
082	0		\|a 511/.5 \|2 19
084			\|a QH 400 \|0 (DE-625)141571: \|2 rvk
084			\|a SK 890 \|0 (DE-625)143267: \|2 rvk
100	1		\|a Berge, Claude \|d 1926-2002 \|e Verfasser \|0 (DE-588)107792109 \|4 aut
240	1	0	\|a Graphes et hypergraphes
245	1	0	\|a Graphs and hypergraphs
250			\|a 2., rev. ed.
264		1	\|a Amsterdam (u.a.) \|b North-Holland Publ. Co. (u.a.) \|c 1976
300			\|a XIV, 528 S. \|b graph.Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a North-Holland mathematical library. \|v 6
650		7	\|a Grafentheorie \|2 gtt
650		4	\|a Graphes, Théorie des
650		4	\|a Hypergraphes
650		4	\|a Graph theory
650		4	\|a Hypergraphs
650	0	7	\|a Graphentheorie \|0 (DE-588)4113782-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Hypergraph \|0 (DE-588)4161063-5 \|2 gnd \|9 rswk-swf
655		7	\|8 1\p \|0 (DE-588)4151278-9 \|a Einführung \|2 gnd-content
689	0	0	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	0		\|5 DE-604
689	1	0	\|a Hypergraph \|0 (DE-588)4161063-5 \|D s
689	1		\|5 DE-604
689	2	0	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	2		\|8 2\p \|5 DE-604
830		0	\|a North-Holland mathematical library. \|v 6 \|w (DE-604)BV000005206 \|9 6
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=001293509&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
940	1		\|q TUB-nveb
999			\|a oai:aleph.bib-bvb.de:BVB01-001293509
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
980	4		\|a (DE-12)AK02040291

Datensatz im Suchindex

_version_	1804116428623708160
adam_text	TABLE OF CONTENTS PART ONE—GRAPHS CHAPTER 1. BASIC CONCEPTS 1. Graphs 3 2. Basic definitions 5 3. List of symbols 9 CHAPTER 2. CYCLOMATIC NUMBER 1. Cycles and cocycles 12 2. Cycles in a planar graph 17 CHAPTER 3. TREES AND ARBORESCENCES 1. Trees and cotrees 24 2. Strongly connected graphs and graphs without circuits .... 28 3. Arborescences 32 4. Injective, functional and semi functional graphs 36 5. Counting trees 42 CHAPTER 4. PATHS, CENTRES AND DIAMETERS 1. The path problem 55 2. The shortest path problem 59 3. Centres and radii of a quasi strong!/ connected graph 61 4. Diameter of a strongly connected graph 66 5. Counting paths 74 CHAPTER 5. FLOW PROBLEMS 1. The maximum flow problem 76 2. The compatible flow problem 86 3. An algebraic study of flows and tensions 89 4. The maximum tension problem 95 CHAPTER 6. DEGREES AND DEMI DEGREES 1. Existence of a p graph with given demi degrees 102 2. Existence of a p graph without loops with given demi degrees . .109 3. Existence of a simple graph with given degrees 115 xi Xii TABLE OF CONTENTS CHAPTER 7. MATCHINGS 1. The maximum matching problem 122 2. The minimum covering problem 129 3. Matchings in bipartite graphs 131 4. An extension of the Konig theorem 141 5. Counting perfect matchings 142 CHAPTER 8. c MATCHINGS 1. The maximum c matching problem 150 2. Transfers 153 3. Maximum cardinality of a c matching 155 CHAPTER 9. CONNECTIVITY 1. /( Connected graphs 164 2. Articulation vertices and blocks 175 3. ^ Edge connected graphs 181 CHAPTER 10. HAMILTONIAN CYCLES 1. Hamiltonian paths and circuits 186 2. Hamiltonian paths in complete graphs 192 3. Existence theorems for hamiltonian circuits 195 4. Existence theorems for hamiltonian cycles 204 5. Hamilton connected graphs 217 6. Hamiltonian cycles in planar graphs (abstract) 223 CHAPTER 11. COVERING EDGES WITH CHAINS 1. Eulerian cycles 228 2. Covering edges with disjoint chains 232 3. Counting eulerian circuits 239 CHAPTER 12. CHROMATIC INDEX 1. Edge colourings 248 2. The Vizing theorem and related results 254 3. Edge colourings of planar graphs (abstract) 267 TABLE OF CONTENTS xiii CHAPTER 13. STABILITY NUMBER 1. Maximum stable sets 272 2. The Turan theorem and related results 278 3. a Critical graphs 285 4. Critical vertices and critical edges 297 5. Stability number and vertex coverings by paths 298 CHAPTER 14. KERNELS AND GRUNDY FUNCTIONS 1. Absorption number 303 2. Kernels 307 3. Grundy functions 312 4. Nim games 318 CHAPTER 15. CHROMATIC NUMBER 1. Vertex colourings 325 2. y Critical graphs 338 3. The Hajos theorem 350 4. Chromatic polynomials 352 5. Vertex colourings of planar graphs (abstract) 355 CHAPTER 16. PERFECT GRAPHS 1. Perfect graphs 360 2. Comparability graphs 363 3. Triangulated graphs 368 4. i Triangulated graphs 369 5. Interval graphs 371 6. Cartesian product and Cartesian sum of simple graphs .... 376 PART TWO—HYPERGRAPHS CHAPTER 17. HYPERGRAPHS AND THEIR DUALS 1. Hypergraphs 389 2. Cycles in a hypergraph 391 3. Conformal hypergraphs 396 4. Representative graph of a hypergraph 400 CHAPTER 18. TRANSVERSALS 1. Matchings and c matchings 414 2. Transversal number 420 XIV TABLE OF CONTENTS CHAPTER 19. CHROMATIC NUMBER OF A HYPERGRAPH 1. Stability number and chromatic number of a hypergraph .... 428 2. Cliques of a hypergraph 432 3. Good colourings of the edges of a graph 440 4. Generalizations of the chromatic number of a graph 443 CHAPTER 20. BALANCED HYPERGRAPHS AND UNIMODULAR HYPERGRAPHS 1. Strong chromatic number 448 2. Balanced hypergraphs 450 3. Unimodular hypergraphs 463 4. Stochastic functions 469 CHAPTER 21. MATROIDS 1. Matroid on a set 476 2. The Rado theorem and related results 481 3. Image of a matroid 486 4. Minimum weight basis 493 REFERENCES 498 INDEX OF DEFINITIONS 523
any_adam_object	1
author	Berge, Claude 1926-2002
author_GND	(DE-588)107792109
author_facet	Berge, Claude 1926-2002
author_role	aut
author_sort	Berge, Claude 1926-2002
author_variant	c b cb
building	Verbundindex
bvnumber	BV001983162
callnumber-first	Q - Science
callnumber-label	QA166
callnumber-raw	QA166
callnumber-search	QA166
callnumber-sort	QA 3166
callnumber-subject	QA - Mathematics
classification_rvk	QH 400 SK 890
ctrlnum	(OCoLC)2107701 (DE-599)BVBBV001983162
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 Wirtschaftswissenschaften
edition	2., rev. ed.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02233nam a2200589 cb4500</leader><controlfield tag="001">BV001983162</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140623 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">890928s1976 d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0720424534</subfield><subfield code="9">0-7204-2453-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)2107701</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV001983162</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-91G</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-12</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">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 400</subfield><subfield code="0">(DE-625)141571:</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="100" ind1="1" ind2=" "><subfield code="a">Berge, Claude</subfield><subfield code="d">1926-2002</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)107792109</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Graphes et hypergraphes</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graphs and hypergraphs</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2., rev. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam (u.a.)</subfield><subfield code="b">North-Holland Publ. Co. (u.a.)</subfield><subfield code="c">1976</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 528 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="490" ind1="1" ind2=" "><subfield code="a">North-Holland mathematical library.</subfield><subfield code="v">6</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafentheorie</subfield><subfield code="2">gtt</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">Hypergraphes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hypergraphs</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">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Hypergraph</subfield><subfield code="0">(DE-588)4161063-5</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)4151278-9</subfield><subfield code="a">Einführung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</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">Hypergraph</subfield><subfield code="0">(DE-588)4161063-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">North-Holland mathematical library.</subfield><subfield code="v">6</subfield><subfield code="w">(DE-604)BV000005206</subfield><subfield code="9">6</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=001293509&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">TUB-nveb</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-001293509</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><datafield tag="980" ind1="4" ind2=" "><subfield code="a">(DE-12)AK02040291</subfield></datafield></record></collection>
genre	1\p (DE-588)4151278-9 Einführung gnd-content
genre_facet	Einführung
id	DE-604.BV001983162
illustrated	Illustrated
indexdate	2024-07-09T15:38:21Z
institution	BVB
isbn	0720424534
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-001293509
oclc_num	2107701
open_access_boolean
owner	DE-91G DE-BY-TUM DE-703 DE-739 DE-706 DE-83 DE-11 DE-188 DE-384 DE-12
owner_facet	DE-91G DE-BY-TUM DE-703 DE-739 DE-706 DE-83 DE-11 DE-188 DE-384 DE-12
physical	XIV, 528 S. graph.Darst.
psigel	TUB-nveb
publishDate	1976
publishDateSearch	1976
publishDateSort	1976
publisher	North-Holland Publ. Co. (u.a.)
record_format	marc
series	North-Holland mathematical library.
series2	North-Holland mathematical library.
spelling	Berge, Claude 1926-2002 Verfasser (DE-588)107792109 aut Graphes et hypergraphes Graphs and hypergraphs 2., rev. ed. Amsterdam (u.a.) North-Holland Publ. Co. (u.a.) 1976 XIV, 528 S. graph.Darst. txt rdacontent n rdamedia nc rdacarrier North-Holland mathematical library. 6 Grafentheorie gtt Graphes, Théorie des Hypergraphes Graph theory Hypergraphs Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graph (DE-588)4021842-9 gnd rswk-swf Hypergraph (DE-588)4161063-5 gnd rswk-swf 1\p (DE-588)4151278-9 Einführung gnd-content Graph (DE-588)4021842-9 s DE-604 Hypergraph (DE-588)4161063-5 s Graphentheorie (DE-588)4113782-6 s 2\p DE-604 North-Holland mathematical library. 6 (DE-604)BV000005206 6 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001293509&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 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Berge, Claude 1926-2002 Graphs and hypergraphs North-Holland mathematical library. Grafentheorie gtt Graphes, Théorie des Hypergraphes Graph theory Hypergraphs Graphentheorie (DE-588)4113782-6 gnd Graph (DE-588)4021842-9 gnd Hypergraph (DE-588)4161063-5 gnd
subject_GND	(DE-588)4113782-6 (DE-588)4021842-9 (DE-588)4161063-5 (DE-588)4151278-9
title	Graphs and hypergraphs
title_alt	Graphes et hypergraphes
title_auth	Graphs and hypergraphs
title_exact_search	Graphs and hypergraphs
title_full	Graphs and hypergraphs
title_fullStr	Graphs and hypergraphs
title_full_unstemmed	Graphs and hypergraphs
title_short	Graphs and hypergraphs
title_sort	graphs and hypergraphs
topic	Grafentheorie gtt Graphes, Théorie des Hypergraphes Graph theory Hypergraphs Graphentheorie (DE-588)4113782-6 gnd Graph (DE-588)4021842-9 gnd Hypergraph (DE-588)4161063-5 gnd
topic_facet	Grafentheorie Graphes, Théorie des Hypergraphes Graph theory Hypergraphs Graphentheorie Graph Hypergraph Einführung
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=001293509&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000005206
work_keys_str_mv	AT bergeclaude graphesethypergraphes AT bergeclaude graphsandhypergraphs

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