A survey on uniquely colorable graphs

zbMATH Open1449.05108MaRDI QIDQ3307707FDOQ3307707

Authors: Zepeng Li 

Publication date: 12 August 2020

Recommendations

• Complexity of unique list colorability
• Forcing structures and cliques in uniquely vertex colorable graphs
• A characterization of uniquely vertex colorable graphs using minimal defining sets
• On uniquely 3-colorable graphs
• scientific article; zbMATH DE number 6433827

zbMATH Keywords

planar graphconstructionunique coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (12)

• On unique graph 3-colorability and parsimonious reductions in the plane
• Uniquely colorable graphs up to automorphisms
• Title not available (Why is that?)
• Defining sets and uniqueness in graph colorings: A survey
• Algebraic characterization of uniquely vertex colorable graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on uniquely H-colorable graphs
• Results on uniquely colorable digraphs
• Title not available (Why is that?)
• \(\gamma\)-chromatic partition in planar graph characterization
• On small uniquely vertex-colourable graphs and Xu's conjecture

This page was built for publication: A survey on uniquely colorable graphs

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