On the chromatic number of a graph with two forbidden subgraphs

DOI10.1016/0095-8956(89)90002-6zbMath0676.05041OpenAlexW2021242070MaRDI QIDQ1122586

Medha Dhurandhar

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90002-6

zbMATH Keywords

chromatic numberforbidden subgraphmaximum clique size

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Claw-free graphs---a survey ⋮ Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs

Cites Work

• On the chromatic index of multigraphs without large triangles
• Note on Choudum's “chromatic bounds for a class of graphs”
• CHROMATIC BOUNDS FOR A CLASS OF GRAPHS
• Unnamed Item

This page was built for publication: On the chromatic number of a graph with two forbidden subgraphs