Distinguishing numbers of finite 4-valent vertex-transitive graphs

DOI10.26493/1855-3974.1849.148zbMath1465.05063arXiv1810.01522OpenAlexW3042967852MaRDI QIDQ4993953

Gabriel Verret, Florian Lehner

Publication date: 11 June 2021

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

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

zbMATH Keywords

vertex colouringvertex-transitive graphsdistinguishing numbersymmetry breaking in graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Group actions on combinatorial structures (05E18)

Related Items (3)

Distinguishing infinite graphs with bounded degrees ⋮ Distinguishing graphs of maximum valence 3 ⋮ On asymmetric colourings of claw-free graphs

Cites Work

• Unnamed Item
• On the vertex-stabiliser in arc-transitive digraphs
• On symmetries of edge and vertex colourings of graphs
• The distinguishing chromatic number
• Tetravalent edge-transitive graphs of girth at most 4
• On cyclic edge-connectivity of transitive graphs
• On groups with no regular orbits on the set of subsets
• The distinguishing number of the hypercube
• Symmetry breaking in graphs
• Distinguishing graphs of maximum valence 3
• Distinguishing labellings of group action on vector spaces and graphs
• Zu einem Isomorphiesatz von H. Whitney für Graphen
• Primitive Groups with no Regular Orbits on the Set of Subsets
• Improving upper bounds for the distinguishing index
• Asymmetric graphs

This page was built for publication: Distinguishing numbers of finite 4-valent vertex-transitive graphs