Bounds for distinguishing invariants of infinite graphs

zbMath1368.05051arXiv1910.12107MaRDI QIDQ2363696

Monika Pilśniak, Rafał Kalinowski, Mohammad Hadi Shekarriz, Wilfried Imrich

Publication date: 26 July 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

symmetry breakinginfinite motion conjecturedistinguishing colouring

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63)

Related Items

Number of colors needed to break symmetries of a graph by an arbitrary edge coloring, Trees with distinguishing index equal distinguishing number plus one, Distinguishing threshold of graphs, Distinguishing graphs of maximum valence 3, On symmetries of edge and vertex colourings of graphs, Number of distinguishing colorings and partitions, The distinguishing number and distinguishing chromatic number for posets

Cites Work

• Unnamed Item
• Distinguishing graphs by edge-colourings
• Distinguishing maps
• The distinguishing chromatic number
• Local finiteness, distinguishing numbers, and Tucker's conjecture
• Chromatic numbers of infinite graphs
• Fixed elements of infinite trees
• A note on the asymptotic and computational complexity of graph distinguishability
• Symmetry breaking in graphs
• The distinguishing index of infinite graphs
• Distinguishing infinite graphs
• Breaking graph symmetries by edge colourings
• Distinguishing labellings of group action on vector spaces and graphs
• Distinguishing graphs by total colourings