On unique coloring of planar graphs

MaRDI QIDQ3012460zbMATH OpenFDO

Authors I. Cahit

Publication date 6 July 2011

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1146229
• Third case of the cyclic coloring conjecture
• scientific article; zbMATH DE number 841583
• A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs
• Planar graphs without cycles of length from 4 to 7 are 3-colorable

Cited in

(7)

• On purely tree-colorable planar graphs
• scientific article; zbMATH DE number 3878955 (Why is no real title available?)
• scientific article; zbMATH DE number 1146229 (Why is no real title available?)
• scientific article; zbMATH DE number 841583 (Why is no real title available?)
• A note on uniquely 3-colourable planar graphs
• Nonplanar graphs and well-covered cycles
• Unique-maximum coloring of plane graphs

This page was built for publication: On unique coloring of planar graphs

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