A note on uniquely 3-colourable planar graphs

DOI10.1080/00207160.2016.1167196MaRDI QIDQ4976305zbMATH OpenOpenAlexFDO

Authors Zepeng Li, Zehui Shao, Jin Xu, Enqiang Zhu

Publication date 28 July 2017

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2016.1167196

zbMATH Keywords

planar graphunique colouringuniquely 3-colourable planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 7145382
• scientific article; zbMATH DE number 7288622
• A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs
• On uniquely 3-colorable graphs
• On unique coloring of planar graphs

Cites work

• An introduction to chromatic polynomials
• On uniquely colorable planar graphs
• One counterexample for two conjectures on three coloring
• Size of edge-critical uniquely 3-colorable planar graphs
• The coloring of graphs
• Uniquely colorable graphs
• Uniquely colorable graphs

Cited in

(9)

• On uniquely 3-colorable graphs
• On uniquely \(3\)-colorable graphs. II
• scientific article; zbMATH DE number 3878955 (Why is no real title available?)
• The size of edge-critical uniquely 3-colorable planar graphs
• scientific article; zbMATH DE number 7288622 (Why is no real title available?)
• Unique chords of unique cycles in 3-connected planar graphs
• Uniquely colorable graphs up to automorphisms
• A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs
• Size of edge-critical uniquely 3-colorable planar graphs

This page was built for publication: A note on uniquely 3-colourable planar graphs

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