Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs
From MaRDI portal
Publication:3595438
DOI10.1007/978-3-540-70666-3_30zbMATH Open1149.05312OpenAlexW1538135112MaRDI QIDQ3595438FDOQ3595438
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
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)
- A characterization of uniquely 2-list colorable graphs
- Uniquely 2-list colorable graphs
- Algebraic characterization of uniquely vertex colorable graphs
- A note on total and list edge-colouring of graphs of tree-width 3
- On uniquely \(k\)-list colorable planar graphs, graphs on surfaces, and regular graphs
- A uniquely 3-list colorable, planar and \(K_4\)-free graph
- 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
- Note on property \(M(k)\) of some complete multipartite graphs
- On uniquely 3-list colorable graphs
- Complexity of unique list colorability
- On property \(M(3)\) of some complete multipartite graphs
- Some conclusion on unique \(k\)-list colorable complete multipartite graphs
- On characterization of uniquely 3-list colorable complete multipartite 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)
