Some applications of Vizing's theorem to vertex colorings of graphs
From MaRDI portal
Publication:1839256
DOI10.1016/0012-365X(83)90043-2zbMath0512.05027MaRDI QIDQ1839256
James H. Schmerl, Henry A. Kierstead
Publication date: 1983
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\), Vizing bound for the chromatic number on some graph classes, Claw-free graphs---a survey, Applications of edge coloring of multigraphs to vertex coloring of graphs, Graph theory (algorithmic, algebraic, and metric problems), Clique covers and coloring problems of graphs, On the chromatic index of multigraphs without large triangles
Cites Work