A uniquely 3-list colorable, planar and K₄-free graph

zbMATH Open1202.05041MaRDI QIDQ3567486FDOQ3567486

Authors: Arash Asadi 

Publication date: 17 June 2010

Recommendations

• On the conjecture of \(U3LC\) planar graphs
• Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs
• On uniquely 3-list colorable graphs
• Disproof of a conjecture on list coloring
• scientific article; zbMATH DE number 2187705

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited In (3)

• On the conjecture of \(U3LC\) planar graphs
• Title not available (Why is that?)
• Disproof of a conjecture on list coloring

This page was built for publication: A uniquely 3-list colorable, planar and \(K_4\)-free graph

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