Coloring triangle-free graphs with fixed size

DOI10.1016/S0012-365X(00)00087-XzbMath0948.05027OpenAlexW2075303922WikidataQ30039999 ScholiaQ30039999MaRDI QIDQ1567684

Carsten Thomassen, John G. Gimbel

Publication date: 19 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00087-x

zbMATH Keywords

chromatic numbertriangle-free graphgenus

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

The $\chi$-Ramsey Problem for Triangle-Free Graphs ⋮ Bipartite induced density in triangle-free graphs ⋮ Adaptable and conflict colouring multigraphs with no cycles of length three or four ⋮ Extremal problems in hypergraph colourings ⋮ Dense induced bipartite subgraphs in triangle-free graphs ⋮ Coloring H-free hypergraphs ⋮ Some Results on Chromatic Number as a Function of Triangle Count

This page was built for publication: Coloring triangle-free graphs with fixed size