Unique list-colourability and the fixing chromatic number of graphs

DOI10.1016/j.dam.2005.04.006zbMath1077.05041OpenAlexW2023761027MaRDI QIDQ2576344

Amir Daneshgar, Hossein Hajiabolhassan

Publication date: 27 December 2005

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

Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.006

zbMATH Keywords

exponential graph constructionuniquely list-colourable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The chromatic number of the product of two 4-chromatic graphs is 4
• On acyclic colorings of planar graphs
• Defining sets in vertex colorings of graphs and latin rectangles
• A survey on Hedetniemi's conjecture
• Uniquely 2-list colorable graphs
• The size of uniquely colorable graphs
• Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs
• Operations with structures
• 25 pretty graph colouring problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item