On uniquely 3-list colorable graphs

MaRDI QIDQ4898487zbMATH OpenFDO

Authors H. Abdollahzadeh Ahangar, L. Pushpalatha, Seyed Mahmood Sheikholeslami, Yancai Zhao

Publication date 2 January 2013

zbMATH Keywords

list coloringuniquely list colorable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

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

Cited in

(17)

• 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 7637228 (Why is no real title available?)
• Three-coloring and list three-coloring of graphs without induced paths on seven vertices
• List coloring with requests
• List coloring and \(n\)-monophilic graphs.
• Uniquely 2-list colorable graphs
• On the conjecture of \(U3LC\) planar graphs
• 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
• Disproof of a conjecture on list coloring
• A uniquely 3-list colorable, planar and \(K_4\)-free graph
• Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs
• A note on total and list edge-colouring of graphs of tree-width 3
• 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: On uniquely 3-list colorable graphs

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