Extremal graphs in some coloring problems

DOI10.1016/S0012-365X(97)00216-1zbMath0957.05059OpenAlexW1993597533MaRDI QIDQ1584287

R. Smith

Publication date: 2 November 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00216-1

zbMATH Keywords

characterizationsextremal graphschromatic numbercoloringNordhaus-Gaddum inequalities

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Graph colourings and partitions ⋮ Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers

Cites Work

• On Complementary Graphs
• The achromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal graphs in some coloring problems