Some applications of Vizing's theorem to vertex colorings of graphs

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)

zbMATH Keywords

chromatic numberchromatic indexmaximal cliquemaximal degreeedge critical multigraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on Choudum's “chromatic bounds for a class of graphs”
• CHROMATIC BOUNDS FOR A CLASS OF GRAPHS
• On edge-colorings of graphs.
• A Theorem on Coloring the Lines of a Network