Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs

DOI10.1007/978-3-540-70666-3_30MaRDI QIDQ3595438zbMATH OpenOpenAlexFDO

Authors Yongqiang Zhao, Wenjie He, Yanning Wang, Yufa Shen

Publication date 28 August 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70666-3_30

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On characterization of uniquely 3-list colorable complete multipartite graphs
• On property \(M(3)\) of some complete multipartite graphs
• On uniquely list colorable complete multipartite graphs
• On uniquely 3-list colorable graphs
• Graphs \(K_{1*4,5}\), \(K_{1*5,4}\), \(K_{1*4,4}\), \(K_{2,3,4}\) have the property \(M(3)\).

Cited in

(14)

• On uniquely 3-list colorable graphs
• On uniquely \(k\)-list colorable planar graphs, graphs on surfaces, and regular graphs
• On property \(M(3)\) of some complete multipartite graphs
• On characterization of uniquely 3-list colorable complete multipartite graphs
• Complexity of unique list colorability
• Graphs \(K_{1*4,5}\), \(K_{1*5,4}\), \(K_{1*4,4}\), \(K_{2,3,4}\) have the property \(M(3)\).
• Uniquely list colorability of complete tripartite graphs
• Uniquely 2-list colorable graphs
• Some conclusion on unique \(k\)-list colorable complete multipartite graphs
• A uniquely 3-list colorable, planar and \(K_4\)-free graph
• A note on total and list edge-colouring of graphs of tree-width 3
• Note on property \(M(k)\) of some complete multipartite graphs
• Algebraic characterization of uniquely vertex colorable graphs
• A characterization of uniquely 2-list colorable graphs

This page was built for publication: Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs

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