Graph edge coloring : Vizing's theorem and Goldberg's conjecture / / Michael Stiebitz ... [et al.].
"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...
Saved in:
| Superior document: | Wiley series in discrete mathematics and optimization |
|---|---|
| : | |
| TeilnehmendeR: | |
| Year of Publication: | 2012 |
| Language: | English |
| Series: | Wiley series in discrete mathematics and optimization.
|
| Online Access: | |
| Physical Description: | xiv, 321 p. :; ill. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
500817847 |
|---|---|
| ctrlnum |
(MiAaPQ)500817847 (Au-PeEL)EBL817847 (CaPaEBR)ebr10540916 (CaONFJC)MIL362144 (OCoLC)780445286 |
| collection |
bib_alma |
| record_format |
marc |
| spelling |
Graph edge coloring [electronic resource] : Vizing's theorem and Goldberg's conjecture / Michael Stiebitz ... [et al.]. Hoboken, N.J. : Wiley, 2012. xiv, 321 p. : ill. 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"-- Provided by publisher. Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries. Graph coloring. Graph theory. Electronic books. Stiebitz, Michael, 1954- ProQuest (Firm) Wiley series in discrete mathematics and optimization. https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=817847 Click to View |
| language |
English |
| format |
Electronic eBook |
| author2 |
Stiebitz, Michael, 1954- ProQuest (Firm) |
| author_facet |
Stiebitz, Michael, 1954- ProQuest (Firm) ProQuest (Firm) |
| author2_variant |
m s ms |
| author2_role |
TeilnehmendeR TeilnehmendeR |
| author_corporate |
ProQuest (Firm) |
| author_sort |
Stiebitz, Michael, 1954- |
| title |
Graph edge coloring Vizing's theorem and Goldberg's conjecture / |
| spellingShingle |
Graph edge coloring Vizing's theorem and Goldberg's conjecture / Wiley series in discrete mathematics and optimization |
| title_sub |
Vizing's theorem and Goldberg's conjecture / |
| title_full |
Graph edge coloring [electronic resource] : Vizing's theorem and Goldberg's conjecture / Michael Stiebitz ... [et al.]. |
| title_fullStr |
Graph edge coloring [electronic resource] : Vizing's theorem and Goldberg's conjecture / Michael Stiebitz ... [et al.]. |
| title_full_unstemmed |
Graph edge coloring [electronic resource] : Vizing's theorem and Goldberg's conjecture / Michael Stiebitz ... [et al.]. |
| title_auth |
Graph edge coloring Vizing's theorem and Goldberg's conjecture / |
| title_new |
Graph edge coloring |
| title_sort |
graph edge coloring vizing's theorem and goldberg's conjecture / |
| series |
Wiley series in discrete mathematics and optimization |
| series2 |
Wiley series in discrete mathematics and optimization |
| publisher |
Wiley, |
| publishDate |
2012 |
| physical |
xiv, 321 p. : ill. |
| isbn |
9781118205563 (electronic bk.) |
| callnumber-first |
Q - Science |
| callnumber-subject |
QA - Mathematics |
| callnumber-label |
QA166 |
| callnumber-sort |
QA 3166.247 G73 42012 |
| genre |
Electronic books. |
| genre_facet |
Electronic books. |
| url |
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=817847 |
| illustrated |
Illustrated |
| dewey-hundreds |
500 - Science |
| dewey-tens |
510 - Mathematics |
| dewey-ones |
511 - General principles of mathematics |
| dewey-full |
511/.56 |
| dewey-sort |
3511 256 |
| dewey-raw |
511/.56 |
| dewey-search |
511/.56 |
| oclc_num |
780445286 |
| work_keys_str_mv |
AT stiebitzmichael graphedgecoloringvizingstheoremandgoldbergsconjecture AT proquestfirm graphedgecoloringvizingstheoremandgoldbergsconjecture |
| status_str |
n |
| ids_txt_mv |
(MiAaPQ)500817847 (Au-PeEL)EBL817847 (CaPaEBR)ebr10540916 (CaONFJC)MIL362144 (OCoLC)780445286 |
| hierarchy_parent_title |
Wiley series in discrete mathematics and optimization |
| is_hierarchy_title |
Graph edge coloring Vizing's theorem and Goldberg's conjecture / |
| container_title |
Wiley series in discrete mathematics and optimization |
| author2_original_writing_str_mv |
noLinkedField noLinkedField |
| _version_ |
1792330723238084610 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02280nam a2200397 a 4500</leader><controlfield tag="001">500817847</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20200520144314.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">111018s2012 njua sb 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2011038045</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781118091371 (hardback)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118205563 (electronic bk.)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)500817847</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL817847</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr10540916</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaONFJC)MIL362144</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)780445286</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA166.247</subfield><subfield code="b">.G73 2012</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">511/.56</subfield><subfield code="2">23</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Graph edge coloring</subfield><subfield code="h">[electronic resource] :</subfield><subfield code="b">Vizing's theorem and Goldberg's conjecture /</subfield><subfield code="c">Michael Stiebitz ... [et al.].</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><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><subfield code="b">ill.</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Wiley series in discrete mathematics and optimization</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and indexes.</subfield></datafield><datafield tag="520" ind1=" " 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><subfield code="c">Provided by publisher.</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph coloring.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Graph theory.</subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stiebitz, Michael,</subfield><subfield code="d">1954-</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Wiley series in discrete mathematics and optimization.</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=817847</subfield><subfield code="z">Click to View</subfield></datafield></record></collection> |