Triangle-free graphs with large chromatic numbers
From MaRDI portal
Publication:1969797
DOI10.1016/S0012-365X(99)00109-0zbMath0944.05032MaRDI QIDQ1969797
Publication date: 15 September 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (10)
Local Clique Covering of Claw-Free Graphs ⋮ The $\chi$-Ramsey Problem for Triangle-Free Graphs ⋮ On some graph classes related to perfect graphs: a survey ⋮ Bipartite induced density in triangle-free graphs ⋮ Circumference, chromatic number and online coloring ⋮ On degree sums of a triangle-free graph ⋮ Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs ⋮ Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs ⋮ Dense induced bipartite subgraphs in triangle-free graphs ⋮ Some Results on Chromatic Number as a Function of Triangle Count
This page was built for publication: Triangle-free graphs with large chromatic numbers
