On coloring graphs with locally small chromatic number

DOI10.1007/BF02579219zbMath0554.05024OpenAlexW2022925674MaRDI QIDQ759761

Endre Szemerédi, H. A. Kiersteadi, William T. jun. Trotter

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579219

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

On constructive methods in the theory of colour-critical graphs ⋮ On graphs with a large chromatic number that contain no small odd cycles ⋮ Local and global colorability of graphs ⋮ Two results on the digraph chromatic number ⋮ Small odd cycles in 4-chromatic graphs ⋮ On the minimal number of edges in color-critical graphs ⋮ 4-chromatic graphs with large odd girth

Cites Work

• Unnamed Item

This page was built for publication: On coloring graphs with locally small chromatic number