Uniquely 2-list colorable graphs

DOI10.1016/S0166-218X(00)00335-8MaRDI QIDQ1613346zbMATH OpenFDO

Authors Y. G. Ganjali, Mehdi Mirzazadeh, B. S. Sadjad, M. Ghebleh, Hossein Hajiabolhassan

Publication date 29 August 2002

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

Full work available at URL https://arxiv.org/abs/math/9906187

zbMATH Keywords

chromatic numberlist coloringuniquely list colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: A graph is called to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on the number of colors used. In this way we generalize a theorem which characterizes uniquely 2-list colorable graphs. We introduce the uniquely list chromatic number of a graph and make a conjecture about it which is a generalization of the well known Brooks' theorem.

Recommendations

• A characterization of uniquely 2-list colorable graphs
• scientific article; zbMATH DE number 2187705
• On uniquely 3-list colorable graphs
• Complexity of unique list colorability
• Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs

Cites work

• scientific article; zbMATH DE number 1802818 (Why is no real title available?)
• scientific article; zbMATH DE number 786139 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 2187705 (Why is no real title available?)
• A characterization of uniquely 2-list colorable graphs

Cited in

(10)

• On uniquely 3-list colorable graphs
• On uniquely \(k\)-list colorable planar graphs, graphs on surfaces, and regular graphs
• Unique list colorability of the graph \(K^n_2+K_r\)
• A relation between choosability and uniquely list colorability
• Complexity of unique list colorability
• Unique list-colourability and the fixing chromatic number of graphs
• scientific article; zbMATH DE number 1802818 (Why is no real title available?)
• scientific article; zbMATH DE number 786139 (Why is no real title available?)
• scientific article; zbMATH DE number 2187705 (Why is no real title available?)
• A characterization of uniquely 2-list colorable graphs

This page was built for publication: Uniquely 2-list colorable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613346)