Symmetry breaking in planar and maximal outerplanar graphs

DOI10.1142/S1793830919500083zbMath1404.05183arXiv1801.08448OpenAlexW2964087637MaRDI QIDQ4621305

Saeid Alikhani, Samaneh Soltani

Publication date: 11 February 2019

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.08448

zbMATH Keywords

Halin graphMycielskian graphdistinguishing numbermaximal outerplanar graphdistinguishing index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Distinguishing Generalized Mycielskian Graphs ⋮ Symmetry parameters for Mycielskian graphs

Cites Work

• Distinguishing graphs by edge-colourings
• Symmetry breaking in graphs
• 3-Connected planar graphs are 5-distinguishing colorable with two exceptions
• On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
• Minimum dominating cycles in 2-trees
• Centers of maximal outerplanar graphs
• Improving upper bounds for the distinguishing index
• Halin graphs and the travelling salesman problem
• Sur le coloriage des graphs

This page was built for publication: Symmetry breaking in planar and maximal outerplanar graphs