Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions

DOI10.1007/s00373-017-1788-1zbMath1380.05079OpenAlexW2619638655MaRDI QIDQ1696528

Seiya Negami, Thomas W. Tucker

Publication date: 14 February 2018

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

Full work available at URL: https://doi.org/10.1007/s00373-017-1788-1

zbMATH Keywords

bipartite graphsdistinguishing coloringpolyhedral maps on closed surfaces

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

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

Cites Work

• Distinguishing maps. II: General case
• Distinguishing maps
• The distinguishing numbers of graphs on closed surfaces
• The distinguishing chromatic number
• Uniqueness and faithfulness of embedding of toroidal graphs
• 3-Connected planar graphs are 5-distinguishing colorable with two exceptions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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