Choice number of 3-colorable elementary graphs

DOI10.1016/S0012-365X(96)00182-3zbMath0888.05027OpenAlexW2039514299WikidataQ126988809 ScholiaQ126988809MaRDI QIDQ1356789

Sylvain Gravier, Frédéric Maffray

Publication date: 1 June 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00182-3

zbMATH Keywords

claw-free graphschoice numberlist-chromatic conjecture

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

On chromatic‐choosable graphs ⋮ Application of polynomial method to on-line list colouring of graphs ⋮ Towards an on-line version of Ohba's conjecture ⋮ On the choice number of claw-free perfect graphs ⋮ Chromatic-choosability of the power of graphs ⋮ On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs ⋮ Chromatic-choosability of hypergraphs with high chromatic number ⋮ On the choosability of claw-free perfect graphs ⋮ List coloring a Cartesian product with a complete bipartite factor ⋮ A Proof of a Conjecture of Ohba

Cites Work

• Unnamed Item
• Recognizing claw-free perfect graphs
• The list chromatic index of a bipartite multigraph
• Some upper bounds on the total and list chromatic numbers of multigraphs

This page was built for publication: Choice number of 3-colorable elementary graphs