The size of edge-critical uniquely 3-colorable planar graphs

zbMath1295.05090MaRDI QIDQ396890

Naoki Matsumoto

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p49

zbMATH Keywords

graph theoryplanar graphsunique coloring

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, Size of edge-critical uniquely 3-colorable planar graphs

Cites Work

• One counterexample for two conjectures on three coloring
• On uniquely 3-colorable planar graphs
• On extremal graphs containing no wheels
• Uniquely colorable graphs
• On uniquely colorable planar graphs