The distinguishing index of graphs with infinite minimum degree

DOI10.1002/JGT.23013zbMath1529.05042arXiv2208.08271OpenAlexW4385459988MaRDI QIDQ6142658

Marcin Stawiski, Trevor M. Wilson

Publication date: 4 January 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

regular graphsinfinite graphsdistinguishing indexdistinguishing colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• Distinguishing graphs by edge-colourings
• On symmetries of edge and vertex colourings of graphs
• The cover-index of infinite graphs
• Symmetry breaking in graphs
• A bound for the distinguishing index of regular graphs
• The distinguishing index of infinite graphs
• Breaking graph symmetries by edge colourings
• Asymmetric trees with two prescribed degrees
• The distinguishing index of the Cartesian product of countable graphs

This page was built for publication: The distinguishing index of graphs with infinite minimum degree