Graph edge coloring: Vizing's theorem and Goldberg's conjecture
Saved in:
| Format: | Electronic eBook |
|---|---|
| Language: | English |
| Published: |
Hoboken, N.J.
Wiley
2012
|
| Series: | Wiley series in discrete mathematics and optimization
|
| Subjects: | |
| Physical Description: | xiv, 321 p. |
| ISBN: | 9781118205563 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044847623 | ||
| 003 | DE-604 | ||
| 005 | 20180305 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180305s2012 |||| o||u| ||||||eng d | ||
| 020 | |a 9781118205563 |c Online |9 978-1-118-20556-3 | ||
| 035 | |a (ZDB-38-ESG)ebr10540916 | ||
| 035 | |a (OCoLC)780445286 | ||
| 035 | |a (DE-599)BVBBV044847623 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 511/.56 |2 23 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 245 | 1 | 0 | |a Graph edge coloring |b Vizing's theorem and Goldberg's conjecture |c Michael Stiebitz ... [et al.] |
| 264 | 1 | |a Hoboken, N.J. |b Wiley |c 2012 | |
| 300 | |a xiv, 321 p. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Wiley series in discrete mathematics and optimization | |
| 505 | 8 | |a Includes bibliographical references and indexes | |
| 505 | 8 | |a "Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historial context throughout. Chapter coverage includes an introduction to coloring preliminaries and lower and upper bounds; the Vizing fan; the Kierstead path; simple graphs and line graphs of multigraphs; the Tashkinov tree; Goldberg's conjecture; extreme graphs; generalized edge coloring; and open problems. It serves as a reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization, as well as a graduate-level course book for students of mathematics, optimization, and computer science"-- | |
| 650 | 4 | |a Graph coloring | |
| 650 | 4 | |a Graph theory | |
| 650 | 0 | 7 | |a Kantenfärbung |0 (DE-588)4163212-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Kombinatorische Wahrscheinlichkeitstheorie |0 (DE-588)4132446-8 |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 Graphfärbung |0 (DE-588)4472286-2 |D s |
| 689 | 0 | 1 | |a Kombinatorische Wahrscheinlichkeitstheorie |0 (DE-588)4132446-8 |D s |
| 689 | 0 | 2 | |a Kantenfärbung |0 (DE-588)4163212-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Stiebitz, Michael |d 1954- |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Hardcover |z 978-1-118-09137-1 |
| 912 | |a ZDB-38-ESG | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030242485 | ||
Record in the Search Index
| _version_ | 1804178361231081472 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV044847623 |
| classification_rvk | SK 890 |
| collection | ZDB-38-ESG |
| contents | Includes bibliographical references and indexes "Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historial context throughout. Chapter coverage includes an introduction to coloring preliminaries and lower and upper bounds; the Vizing fan; the Kierstead path; simple graphs and line graphs of multigraphs; the Tashkinov tree; Goldberg's conjecture; extreme graphs; generalized edge coloring; and open problems. It serves as a reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization, as well as a graduate-level course book for students of mathematics, optimization, and computer science"-- |
| ctrlnum | (ZDB-38-ESG)ebr10540916 (OCoLC)780445286 (DE-599)BVBBV044847623 |
| dewey-full | 511/.56 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.56 |
| dewey-search | 511/.56 |
| dewey-sort | 3511 256 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02382nmm a2200445zc 4500</leader><controlfield tag="001">BV044847623</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180305 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180305s2012 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118205563</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-118-20556-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-ESG)ebr10540916</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)780445286</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044847623</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="082" ind1="0" ind2=" "><subfield code="a">511/.56</subfield><subfield code="2">23</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="245" ind1="1" ind2="0"><subfield code="a">Graph edge coloring</subfield><subfield code="b">Vizing's theorem and Goldberg's conjecture</subfield><subfield code="c">Michael Stiebitz ... [et al.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, N.J.</subfield><subfield code="b">Wiley</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiv, 321 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">Wiley series in discrete mathematics and optimization</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Includes bibliographical references and indexes</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">"Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historial context throughout. Chapter coverage includes an introduction to coloring preliminaries and lower and upper bounds; the Vizing fan; the Kierstead path; simple graphs and line graphs of multigraphs; the Tashkinov tree; Goldberg's conjecture; extreme graphs; generalized edge coloring; and open problems. It serves as a reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization, as well as a graduate-level course book for students of mathematics, optimization, and computer science"--</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph coloring</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">Kantenfärbung</subfield><subfield code="0">(DE-588)4163212-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorische Wahrscheinlichkeitstheorie</subfield><subfield code="0">(DE-588)4132446-8</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">Graphfärbung</subfield><subfield code="0">(DE-588)4472286-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kombinatorische Wahrscheinlichkeitstheorie</subfield><subfield code="0">(DE-588)4132446-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Kantenfärbung</subfield><subfield code="0">(DE-588)4163212-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">Stiebitz, Michael</subfield><subfield code="d">1954-</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Hardcover</subfield><subfield code="z">978-1-118-09137-1</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-38-ESG</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030242485</subfield></datafield></record></collection> |
| id | DE-604.BV044847623 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:02:45Z |
| institution | BVB |
| isbn | 9781118205563 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030242485 |
| oclc_num | 780445286 |
| open_access_boolean | |
| physical | xiv, 321 p. |
| psigel | ZDB-38-ESG |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Wiley |
| record_format | marc |
| series2 | Wiley series in discrete mathematics and optimization |
| spelling | Graph edge coloring Vizing's theorem and Goldberg's conjecture Michael Stiebitz ... [et al.] Hoboken, N.J. Wiley 2012 xiv, 321 p. txt rdacontent c rdamedia cr rdacarrier Wiley series in discrete mathematics and optimization Includes bibliographical references and indexes "Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historial context throughout. Chapter coverage includes an introduction to coloring preliminaries and lower and upper bounds; the Vizing fan; the Kierstead path; simple graphs and line graphs of multigraphs; the Tashkinov tree; Goldberg's conjecture; extreme graphs; generalized edge coloring; and open problems. It serves as a reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization, as well as a graduate-level course book for students of mathematics, optimization, and computer science"-- Graph coloring Graph theory Kantenfärbung (DE-588)4163212-6 gnd rswk-swf Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 gnd rswk-swf Graphfärbung (DE-588)4472286-2 gnd rswk-swf Graphfärbung (DE-588)4472286-2 s Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 s Kantenfärbung (DE-588)4163212-6 s DE-604 Stiebitz, Michael 1954- Sonstige oth Erscheint auch als Druck-Ausgabe, Hardcover 978-1-118-09137-1 |
| spellingShingle | Graph edge coloring Vizing's theorem and Goldberg's conjecture Includes bibliographical references and indexes "Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historial context throughout. Chapter coverage includes an introduction to coloring preliminaries and lower and upper bounds; the Vizing fan; the Kierstead path; simple graphs and line graphs of multigraphs; the Tashkinov tree; Goldberg's conjecture; extreme graphs; generalized edge coloring; and open problems. It serves as a reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization, as well as a graduate-level course book for students of mathematics, optimization, and computer science"-- Graph coloring Graph theory Kantenfärbung (DE-588)4163212-6 gnd Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 gnd Graphfärbung (DE-588)4472286-2 gnd |
| subject_GND | (DE-588)4163212-6 (DE-588)4132446-8 (DE-588)4472286-2 |
| title | Graph edge coloring Vizing's theorem and Goldberg's conjecture |
| title_auth | Graph edge coloring Vizing's theorem and Goldberg's conjecture |
| title_exact_search | Graph edge coloring Vizing's theorem and Goldberg's conjecture |
| title_full | Graph edge coloring Vizing's theorem and Goldberg's conjecture Michael Stiebitz ... [et al.] |
| title_fullStr | Graph edge coloring Vizing's theorem and Goldberg's conjecture Michael Stiebitz ... [et al.] |
| title_full_unstemmed | Graph edge coloring Vizing's theorem and Goldberg's conjecture Michael Stiebitz ... [et al.] |
| title_short | Graph edge coloring |
| title_sort | graph edge coloring vizing s theorem and goldberg s conjecture |
| title_sub | Vizing's theorem and Goldberg's conjecture |
| topic | Graph coloring Graph theory Kantenfärbung (DE-588)4163212-6 gnd Kombinatorische Wahrscheinlichkeitstheorie (DE-588)4132446-8 gnd Graphfärbung (DE-588)4472286-2 gnd |
| topic_facet | Graph coloring Graph theory Kantenfärbung Kombinatorische Wahrscheinlichkeitstheorie Graphfärbung |
| work_keys_str_mv | AT stiebitzmichael graphedgecoloringvizingstheoremandgoldbergsconjecture |