The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)

DOI10.1016/0012-365X(86)90142-1zbMath0596.05028MaRDI QIDQ1078192

James H. Schmerl, Henry A. Kierstead

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberclique numbermaximal degreelinear graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Claw-free graphs---a survey ⋮ Applications of edge coloring of multigraphs to vertex coloring of graphs ⋮ Strengthening Brooks' chromatic bound on \(P_6\)-free graphs ⋮ Graph coloring approach with new upper bounds for the chromatic number: team building application ⋮ Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs ⋮ Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences

Cites Work

• On the chromatic index of multigraphs without large triangles
• Improvement on Brooks' chromatic bound for a class of graphs
• Some applications of Vizing's theorem to vertex colorings of graphs
• On edge-colorings of graphs.
• Unnamed Item