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 uppe...
Shranjeno v:
| Drugi avtorji: | |
|---|---|
| Format: | Elektronski eKnjiga |
| Jezik: | angleščina |
| Izdano: |
Hoboken, N.J. :
Wiley,
2012.
|
| Serija: | Wiley series in discrete mathematics and optimization.
|
| Teme: | |
| Online dostop: | https://biblioteca.ues.edu.sv/acceso/elibro/?url=https%3A%2F%2Felibro.net%2Fereader%2Fbiblioues/181830 Ver en el OPAC |
| Oznake: |
Brez oznak, prvi označite!
|
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ELB181830 | ||
| 003 | FINmELB | ||
| 005 | 20250820144314.0 | ||
| 006 | m o d | | ||
| 007 | cr cn||||||||| | ||
| 008 | 250820s2012 njua sb 001 0 eng d | ||
| 010 | |z 2011038045 | ||
| 020 | |a 9781118205563 |q (ebook) | ||
| 020 | |z 9781118091371 |q (print) | ||
| 035 | |a (OCoLC)747529203 | ||
| 040 | |a FINmELB |b eng |e rda |c FINmELB | ||
| 050 | 4 | |a QA166.247 |b .G73 2012 | |
| 082 | 0 | 4 | |a 511/.56 |2 23 |
| 245 | 0 | 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. : |b ill. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a data file |2 rda | ||
| 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. | ||
| 588 | |a Description based on metadata supplied by the publisher and other sources. | ||
| 590 | |a Electronic resource. Santa Fe, Argentina: elibro, 2025. Available via the World Wide Web. Access may be limited to libraries affiliated with elibro. | ||
| 650 | 0 | |a Graph coloring. | |
| 650 | 0 | |a Graph theory. | |
| 655 | 4 | |a Electronic books. | |
| 700 | 1 | |a Stiebitz, Michael, |d 1954- | |
| 797 | 2 | |a elibro, Corp. | |
| 830 | 0 | |a Wiley series in discrete mathematics and optimization. | |
| 856 | 4 | 0 | |u https://biblioteca.ues.edu.sv/acceso/elibro/?url=https%3A%2F%2Felibro.net%2Fereader%2Fbiblioues/181830 |