CHROMATIC BOUNDS FOR A CLASS OF GRAPHS

DOI10.1093/qmath/28.3.257zbMath0364.05023OpenAlexW2039562850MaRDI QIDQ4138749

Sheshayya 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)

Related Items (max. 100)

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 ⋮ On the chromatic number of a graph with two forbidden subgraphs ⋮ Improvement on Brooks' chromatic bound for a class of graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Some applications of Vizing's theorem to vertex colorings of graphs ⋮ On the chromatic index of multigraphs without large triangles

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