Graph edge coloring Vizing's theorem and Goldberg's conjecture /
"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...
Sábháilte in:
| Údar corparáideach: | |
|---|---|
| Rannpháirtithe: | |
| Formáid: | Leictreonach Ríomhleabhar |
| Teanga: | Béarla |
| Foilsithe / Cruthaithe: |
Hoboken, N.J. :
Wiley,
2012.
|
| Sraith: | Wiley series in discrete mathematics and optimization.
|
| Ábhair: | |
| Rochtain ar líne: | An electronic book accessible through the World Wide Web; click to view |
| Clibeanna: |
Cuir clib leis
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|
MARC
| LEADER | 00000nam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | 0000146859 | ||
| 005 | 20171002062046.0 | ||
| 006 | m u | ||
| 007 | cr cn||||||||| | ||
| 008 | 111018s2012 njua sb 001 0 eng d | ||
| 010 | |z 2011038045 | ||
| 020 | |z 9781118091371 (hardback) | ||
| 020 | |z 9781118205563 (e-book) | ||
| 035 | |a (CaPaEBR)ebr10540916 | ||
| 035 | |a (OCoLC)780445286 | ||
| 040 | |a CaPaEBR |c CaPaEBR | ||
| 050 | 1 | 4 | |a QA166.247 |b .G73 2012eb |
| 082 | 0 | 4 | |a 511/.56 |2 23 |
| 245 | 0 | 0 | |a Graph edge coloring |h [electronic resource] : |b Vizing's theorem and Goldberg's conjecture / |c Michael Stiebitz ... [et al.]. |
| 260 | |a Hoboken, N.J. : |b Wiley, |c 2012. | ||
| 300 | |a xiv, 321 p. : |b ill. | ||
| 490 | 1 | |a Wiley series in discrete mathematics and optimization | |
| 504 | |a Includes bibliographical references and indexes. | ||
| 520 | |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"-- |c Provided by publisher. | ||
| 533 | |a Electronic reproduction. |b Palo Alto, Calif. : |c ebrary, |d 2013. |n Available via World Wide Web. |n Access may be limited to ebrary affiliated libraries. | ||
| 650 | 0 | |a Graph coloring. | |
| 650 | 0 | |a Graph theory. | |
| 655 | 7 | |a Electronic books. |2 local | |
| 700 | 1 | |a Stiebitz, Michael, |d 1954- | |
| 710 | 2 | |a ebrary, Inc. | |
| 830 | 0 | |a Wiley series in discrete mathematics and optimization. | |
| 856 | 4 | 0 | |u http://site.ebrary.com/lib/daystar/Doc?id=10540916 |z An electronic book accessible through the World Wide Web; click to view |
| 908 | |a 170314 | ||
| 942 | 0 | 0 | |c EB |
| 999 | |c 136008 |d 136008 | ||