A relation between choosability and uniquely list colorability

DOI10.1016/j.jctb.2005.12.001zbMath1100.05032OpenAlexW2049904819MaRDI QIDQ2496207

B. S. Sadjad, Saieed Akbari, Vahab S. Mirrokni

Publication date: 12 July 2006

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.12.001

zbMATH Keywords

unique list coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On two generalizations of the Alon-Tarsi polynomial method ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs ⋮ An algebraic criterion for the choosability of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Colorings and orientations of graphs
• On uniquely 3-colorable graphs
• List edge and list total colourings of multigraphs
• Uniquely 2-list colorable graphs
• \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
• The list chromatic index of a bipartite multigraph
• The size of uniquely colorable graphs
• Some upper bounds on the total and list chromatic numbers of multigraphs
• Uniquely Colourable Graphs with Large Girth
• Uniquely colorable graphs
• 25 pretty graph colouring problems

This page was built for publication: A relation between choosability and uniquely list colorability