On the lower bound for the chromatic number of graphs with given maximal degree and girth

zbMath1076.05038MaRDI QIDQ2575545

V. A. Tashkinov

Publication date: 12 December 2005

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51821

zbMATH Keywords

densitycoloringsparse graph

Mathematics Subject Classification ID

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

Related Items

Extremal problems in hypergraph colourings, Constructions of sparse uniform hypergraphs with high chromatic number