@article{462032,
      recid = {462032},
      author = {Stiebitz, Michael,},
      title = {Graph edge coloring Vizing's theorem and Goldberg's  conjecture / [electronic resource] :},
      publisher = {Wiley,},
      address = {Hoboken, N.J. :},
      pages = {xiv, 321 p. :},
      year = {2012},
      abstract = {"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"--},
      url = {http://library.usi.edu/record/462032},
}