Coloring mixed hypergraphs: theory, algorithms, and applications
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Providence, Rhode Island
American Mathematical Society
[2002]
|
| Schriftenreihe: | Fields Institute Monographs
17 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverzeichnis Seiten 171 - 178 |
| Beschreibung: | xiii, 181 Seiten Illustrationen, Diagramme |
| ISBN: | 0821828126 9780821828120 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV026936235 | ||
| 003 | DE-604 | ||
| 005 | 20240819 | ||
| 007 | t | ||
| 008 | 110326s2002 a||| |||| 00||| eng d | ||
| 015 | |a bA254767 |2 dnb | ||
| 020 | |a 0821828126 |9 0-8218-2812-6 | ||
| 020 | |a 9780821828120 |9 978-0-8218-2812-0 | ||
| 035 | |a (OCoLC)248650481 | ||
| 035 | |a (DE-599)BVBBV026936235 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-188 | ||
| 082 | 0 | |a 511.5 |2 21 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Voloshin, Vitaly I. |d 1954- |e Verfasser |0 (DE-588)139301046 |4 aut | |
| 245 | 1 | 0 | |a Coloring mixed hypergraphs |b theory, algorithms, and applications |c Vitaly I. Voloshin |
| 264 | 1 | |a Providence, Rhode Island |b American Mathematical Society |c [2002] | |
| 264 | 4 | |c © 2002 | |
| 300 | |a xiii, 181 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Fields Institute Monographs |v 17 | |
| 500 | |a Literaturverzeichnis Seiten 171 - 178 | ||
| 650 | 4 | |a Hypergraphs | |
| 650 | 4 | |a Map-coloring problem | |
| 650 | 0 | 7 | |a Hypergraph |0 (DE-588)4161063-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphfärbung |0 (DE-588)4472286-2 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Hypergraph |0 (DE-588)4161063-5 |D s |
| 689 | 0 | 1 | |a Graphfärbung |0 (DE-588)4472286-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-4704-3144-0 |
| 810 | 2 | |a Fields Institute for Research in Mathematical Sciences <Canada> |t Fields Institute monographs |v 17 |w (DE-604)BV009737926 |9 17 | |
| 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=022457794&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-022457794 | |
Datensatz im Suchindex
| _version_ | 1807864647761526784 |
|---|---|
| adam_text |
Contents
Preface xiii
Introduction 1
0.1. Overview of graph coloring 1
0.2. Mixed hypergraphs and their coloring 3
0.3. Unforeseen features of mixed hypergraph coloring 3
0.4. Philosophical motivation of mixed hypergraph coloring 4
0.5. Organization 5
0.6. Acknowledgments 9
Chapter 1. The Lower Chromatic Number of a Hypergraph 11
1.1. General concepts 11
1.2. A brief history of coloring theory 16
1.3. Basic results on hypergraph coloring 19
1.4. Hypertrees and chordal conformal hypergraphs 23
Chapter 2. Mixed Hypergraphs and the Upper Chromatic
Number 27
2.1. Basic definitions 27
2.2. Splitting-contraction algorithm 30
2.3. Basic properties of the upper chromatic number 34
2.4. Greedy C-hypergraph coloring algorithms 37
2.5. Algorithmic complexity 42
2.6. Open problems 43
Chapter 3. Uncolorable Mixed Hypergraphs 45
3.1. Minimal uncolorable mixed hypergraphs 45
3.2. Uncolorability measures and a greedy algorithm 48
3.3. Colorability as an integer programming problem 52
3.4. Special types of uncolorable mixed hypergraphs 54
3.5. Open problems 57
Chapter 4. Uniquely Colorable Mixed Hypergraphs 59
4.1. Preliminary 59
4.2. Embeddings into uc mixed hypergraphs 60
4.3. Separation using uc subhypergraphs 61
4.4. Recursive operations 63
4.5. Algorithmic complexity 67
4.6. UC mixed hypergraphs with x n — 2 67
4.7. Uniquely colorable mixed hypertrees 71
ix
x Contents
4.8. Open problems 76
Chapter 5. C-perfect Mixed Hypergraphs 79
5.1. Basic concepts 79
5.2. Minimal non-C-perfect mixed hypergraphs 81
5.3. C-perfection of mixed hypertrees 84
5.4. Algorithmic aspects of C-perfection 85
5.5. Open problems 86
Chapter 6. Gaps in the Chromatic Spectrum 89
6.1. The smallest mixed hypergraphs with gaps 89
6.2. Feasible sets and a doubling-shifting algorithm 91
6.3. Smaller realization 93
6.4. 0-1 realization 95
6.5. Uniform bihypergraphs may have gaps 96
6.6. Separation on uc preserves continuity 98
6.7. Open problems 99
Chapter 7. Interval Mixed Hypergraphs 101
7.1. Colorings 101
7.2. Linear time algorithm for the upper chromatic number 104
7.3. Chromatic spectrum is continuous 105
7.4. Open problems 106
Chapter 8. Pseudo-chordal Mixed Hypergraphs 107
8.1. Preliminaries 107
8.2. Chromatic polynomial 109
8.3. Consequences and examples 111
8.4. A universal formula for chordal graphs 115
8.5. Open problems 117
Chapter 9. Circular Mixed Hypergraphs 119
9.1. Preliminaries 119
9.2. Unique colorability, n even 121
9.3. Unique colorability, n odd 123
9.4. Colorability and lower chromatic number 125
9.5. Upper chromatic number 125
9.6. Open problems 127
Chapter 10. Planar Mixed Hypergraphs 129
10.1. Classic planar hypergraphs 129
10.2. Coloring bitriangulations 130
10.3. Bounds for the upper chromatic number 135
10.4. Gaps in the chromatic spectrum 137
10.5. Open problems 138
Chapter 11. Coloring Block Designs as Mixed Hypergraphs 141
11.1. Steiner systems 141
11.2. Steiner triple systems 143
11.3. Steiner quadruple systems 149
11.4. Open problems 153
Contents xi
Chapter 12. Modelling with Mixed Hypergraphs 155
12.1. List colorings without lists 155
12.2. Ramsey, anti-Ramsey and related problems 156
12.3. Mixed hypergraphs and integer programming 158
12.4. Resource allocation 162
12.5. Lifetime of set systems 165
12.6. Parallel computing 165
12.7. Database management 165
12.8. Molecular biology 166
12.9. Genetics of populations 168
12.10. Natural number interpretation 169
Bibliography 171
List of Figures 179
Index 181 |
| any_adam_object | 1 |
| author | Voloshin, Vitaly I. 1954- |
| author_GND | (DE-588)139301046 |
| author_facet | Voloshin, Vitaly I. 1954- |
| author_role | aut |
| author_sort | Voloshin, Vitaly I. 1954- |
| author_variant | v i v vi viv |
| building | Verbundindex |
| bvnumber | BV026936235 |
| classification_rvk | SK 890 |
| ctrlnum | (OCoLC)248650481 (DE-599)BVBBV026936235 |
| 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.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV026936235</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240819</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110326s2002 a||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">bA254767</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0821828126</subfield><subfield code="9">0-8218-2812-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780821828120</subfield><subfield code="9">978-0-8218-2812-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248650481</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV026936235</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">21</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">Voloshin, Vitaly I.</subfield><subfield code="d">1954-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)139301046</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Coloring mixed hypergraphs</subfield><subfield code="b">theory, algorithms, and applications</subfield><subfield code="c">Vitaly I. Voloshin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Providence, Rhode Island</subfield><subfield code="b">American Mathematical Society</subfield><subfield code="c">[2002]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiii, 181 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</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">Fields Institute Monographs</subfield><subfield code="v">17</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverzeichnis Seiten 171 - 178</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Hypergraphs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Map-coloring problem</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="650" ind1="0" ind2="7"><subfield code="a">Graphfärbung</subfield><subfield code="0">(DE-588)4472286-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="1"><subfield code="a">Graphfärbung</subfield><subfield code="0">(DE-588)4472286-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-4704-3144-0</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Fields Institute for Research in Mathematical Sciences <Canada></subfield><subfield code="t">Fields Institute monographs</subfield><subfield code="v">17</subfield><subfield code="w">(DE-604)BV009737926</subfield><subfield code="9">17</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=022457794&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-022457794</subfield></datafield></record></collection> |
| id | DE-604.BV026936235 |
| illustrated | Illustrated |
| indexdate | 2024-08-20T00:34:41Z |
| institution | BVB |
| isbn | 0821828126 9780821828120 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-022457794 |
| oclc_num | 248650481 |
| open_access_boolean | |
| owner | DE-188 |
| owner_facet | DE-188 |
| physical | xiii, 181 Seiten Illustrationen, Diagramme |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | American Mathematical Society |
| record_format | marc |
| series2 | Fields Institute Monographs |
| spelling | Voloshin, Vitaly I. 1954- Verfasser (DE-588)139301046 aut Coloring mixed hypergraphs theory, algorithms, and applications Vitaly I. Voloshin Providence, Rhode Island American Mathematical Society [2002] © 2002 xiii, 181 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Fields Institute Monographs 17 Literaturverzeichnis Seiten 171 - 178 Hypergraphs Map-coloring problem Hypergraph (DE-588)4161063-5 gnd rswk-swf Graphfärbung (DE-588)4472286-2 gnd rswk-swf Hypergraph (DE-588)4161063-5 s Graphfärbung (DE-588)4472286-2 s DE-604 Erscheint auch als Online-Ausgabe 978-1-4704-3144-0 Fields Institute for Research in Mathematical Sciences <Canada> Fields Institute monographs 17 (DE-604)BV009737926 17 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=022457794&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Voloshin, Vitaly I. 1954- Coloring mixed hypergraphs theory, algorithms, and applications Hypergraphs Map-coloring problem Hypergraph (DE-588)4161063-5 gnd Graphfärbung (DE-588)4472286-2 gnd |
| subject_GND | (DE-588)4161063-5 (DE-588)4472286-2 |
| title | Coloring mixed hypergraphs theory, algorithms, and applications |
| title_auth | Coloring mixed hypergraphs theory, algorithms, and applications |
| title_exact_search | Coloring mixed hypergraphs theory, algorithms, and applications |
| title_full | Coloring mixed hypergraphs theory, algorithms, and applications Vitaly I. Voloshin |
| title_fullStr | Coloring mixed hypergraphs theory, algorithms, and applications Vitaly I. Voloshin |
| title_full_unstemmed | Coloring mixed hypergraphs theory, algorithms, and applications Vitaly I. Voloshin |
| title_short | Coloring mixed hypergraphs |
| title_sort | coloring mixed hypergraphs theory algorithms and applications |
| title_sub | theory, algorithms, and applications |
| topic | Hypergraphs Map-coloring problem Hypergraph (DE-588)4161063-5 gnd Graphfärbung (DE-588)4472286-2 gnd |
| topic_facet | Hypergraphs Map-coloring problem Hypergraph Graphfärbung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=022457794&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV009737926 |
| work_keys_str_mv | AT voloshinvitalyi coloringmixedhypergraphstheoryalgorithmsandapplications |