Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum

DOI10.1016/S0166-218X(03)00377-9zbMath1043.05044OpenAlexW2036299795MaRDI QIDQ1827854

Simone Dantas, Frédéric Maffray, Sylvain Gravier

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00377-9

zbMATH Keywords

Graph coloringList coloring

Mathematics Subject Classification ID

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

Related Items (7)

Extremal decompositions for Nordhaus-Gaddum theorems ⋮ On a list-coloring problem ⋮ On conflict-free connection of graphs ⋮ On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers ⋮ Choice number and energy of graphs ⋮ Extension of a list coloring problem ⋮ Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers

Cites Work

• Linear recognition of pseudo-split graphs
• On a list-coloring problem
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• On Complementary Graphs
• Graph colorings with local constraints -- a survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum