The distinguishing numbers of graphs on closed surfaces

DOI10.1016/j.disc.2011.10.023zbMath1237.05184OpenAlexW2023072557MaRDI QIDQ764885

Seiya Negami

Publication date: 16 March 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.023

zbMATH Keywords

distinguishing numbertopological graph theoryre-embedding of graphstriangulations on closed surfaces

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Rigidity and separation indices of graphs in surfaces ⋮ Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinguishing maps
• Note on the irreducible triangulations of the Klein bottle
• Uniquely and faithfully embeddable projective-planar triangulations
• Irreducible triangulations of the Klein bottle
• The distinguishing number of the hypercube
• Uniqueness and faithfulness of embedding of toroidal graphs
• Generating the triangulations of the projective plane
• Symmetry breaking in graphs
• Panel structures of triangulations on the torus

This page was built for publication: The distinguishing numbers of graphs on closed surfaces