On uniquely 3-list colorable graphs
From MaRDI portal
Publication:4898487
zbMATH Open1262.05046MaRDI QIDQ4898487FDOQ4898487
Authors: H. Abdollahzadeh Ahangar, L. Pushpalatha, Seyed Mahmood Sheikholeslami, Yancai Zhao 
Publication date: 2 January 2013
Recommendations
Cited In (17)
- Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs
- Unique list-colourability and the fixing chromatic number of graphs
- 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
- A characterization of uniquely 2-list colorable graphs
- Uniquely 2-list colorable graphs
- Title not available (Why is that?)
- A relation between choosability and uniquely list colorability
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices
- On the conjecture of \(U3LC\) planar graphs
- A note on total and list edge-colouring of graphs of tree-width 3
- A uniquely 3-list colorable, planar and \(K_4\)-free graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- List coloring with requests
- List coloring and \(n\)-monophilic graphs.
- Complexity of unique list colorability
- Disproof of a conjecture on list coloring
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)
