3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions

DOI10.1007/S00373-015-1620-8zbMath1327.05120OpenAlexW1811336774MaRDI QIDQ897252

Seiya Negami

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1620-8

zbMATH Keywords

maps on surfacesdistinguishing coloring3-regular graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Distinguishing maps. II: General case
• Distinguishing maps
• The distinguishing chromatic number
• Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions
• 3-Connected planar graphs are 5-distinguishing colorable with two exceptions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions