On coloring graphs with locally small chromatic number

DOI10.1007/BF02579219zbMATH Open0554.05024OpenAlexW2022925674MaRDI QIDQ759761FDOQ759761

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

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)

Recommendations

• Local and global colorability of graphs
• Coloring graphs with locally few colors
• On graphs with small subgraphs of large chromatic number
• On circuits and subgraphs of chromatic graphs
• scientific article; zbMATH DE number 3251276

Cited in

(17)

• Two results on the digraph chromatic number
• On graphs with a large chromatic number that contain no small odd cycles
• On the minimal number of edges in color-critical graphs
• scientific article; zbMATH DE number 653253 (Why is no real title available?)
• Locally identifying coloring of graphs with few P4s
• Locally restricted colorings
• Coloring \(k\)-colorable graphs using smaller palettes
• Subgraphs of Kneser graphs with large girth and large chromatic number
• On constructive methods in the theory of colour-critical graphs
• Local and global colorability of graphs
• 4-chromatic graphs with large odd girth
• Coloring graphs with locally few colors
• On circuits and subgraphs of chromatic graphs
• On the chromatic number of the Erdős-Rényi orthogonal polarity graph
• Small odd cycles in 4-chromatic graphs
• The chromatic profile of locally bipartite graphs
• scientific article; zbMATH DE number 4108789 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759761)