CHROMATIC BOUNDS FOR A CLASS OF GRAPHS

DOI10.1093/QMATH/28.3.257zbMATH Open0364.05023OpenAlexW2039562850MaRDI QIDQ4138749FDOQ4138749

Authors: S. A. Choudum 

Publication date: 1977

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/28.3.257

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cited In (8)

• Applications of edge coloring of multigraphs to vertex coloring of graphs
• Claw-free graphs---a survey
• Graph theory (algorithmic, algebraic, and metric problems)
• On the chromatic index of multigraphs without large triangles
• On the chromatic number of a graph with two forbidden subgraphs
• Vizing bound for the chromatic number on some graph classes
• Some applications of Vizing's theorem to vertex colorings of graphs
• Improvement on Brooks' chromatic bound for a class of graphs

This page was built for publication: CHROMATIC BOUNDS FOR A CLASS OF GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138749)