Triangle-free four-chromatic graphs

DOI10.1016/0012-365X(94)00063-OzbMath0841.05030MaRDI QIDQ1901038

Guoping Jin

Publication date: 14 July 1996

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

zbMATH Keywords

chromatic numberHäggkvist's conjecture

Mathematics Subject Classification ID

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

Related Items (14)

The chromatic profile of locally colourable graphs ⋮ On the local density problem for graphs of given odd-girth ⋮ On the Structure of Graphs with Given Odd Girth and Large Minimum Degree ⋮ On some graph classes related to perfect graphs: a survey ⋮ The chromatic profile of locally bipartite graphs ⋮ Andrásfai and Vega graphs in Ramsey–Turán theory ⋮ The minimum degree removal lemma thresholds ⋮ Critical graphs without triangles: an optimum density construction ⋮ Cycle-maximal triangle-free graphs ⋮ On the KŁR conjecture in random graphs ⋮ Sparse halves in dense triangle-free graphs ⋮ Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz ⋮ Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\) ⋮ Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On a valence problem in extremal graph theory
• ODD Cycles of Specified Length in Non-Bipartite Graphs

This page was built for publication: Triangle-free four-chromatic graphs