On a list-coloring problem

DOI10.1016/S0012-365X(03)00033-5zbMath1018.05028OpenAlexW1985935983MaRDI QIDQ1398274

Frédéric Maffray, Sylvain Gravier, Bojan Mohar

Publication date: 29 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00033-5

zbMATH Keywords

joinlist-chromatic numberlist-coloring\(k\)-choosable graph

Mathematics Subject Classification ID

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

Related Items (4)

Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Choice number and energy of graphs ⋮ Extension of a list coloring problem ⋮ Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum

Cites Work

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

This page was built for publication: On a list-coloring problem