Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
"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"--
"This book provides an overview of this development as well as describes how the many different results are related"--
Check nearby libraries
Buy this book
![Loading indicator](/images/ajax-loader-bar.gif)
Previews available in: English
Showing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
Graph edge coloring: Vizing's theorem and Goldberg's conjecture
2012, Wiley
in English
111809137X 9781118091371
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Includes bibliographical references and indexes.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?History
- Created October 27, 2011
- 8 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
2 days ago | Edited by MARC Bot | import existing book |
October 4, 2021 | Edited by ImportBot | import existing book |
September 25, 2020 | Edited by MARC Bot | import existing book |
August 21, 2020 | Edited by ImportBot | import existing book |
October 27, 2011 | Created by LC Bot | Imported from Library of Congress MARC record |