Distinguishing infinite graphs with bounded degrees

DOI10.1002/jgt.22809zbMath1522.05335arXiv1810.03932OpenAlexW4210952252MaRDI QIDQ6081887

Monika Pilśniak, Florian Lehner, Marcin Stawiski

Publication date: 5 October 2023

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

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

zbMATH Keywords

distinguishing numberasymmetric colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Infinite graphs (05C63)

Related Items (2)

The role of the Axiom of Choice in proper and distinguishing colourings ⋮ Asymmetric colouring of locally compact permutation groups

Cites Work

• Distinguishing maps
• The distinguishing chromatic number
• Local finiteness, distinguishing numbers, and Tucker's conjecture
• On asymmetric colourings of claw-free graphs
• Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
• Infinite motion and 2-distinguishability of graphs and groups
• Distinguishing graphs of maximum valence 3
• Distinguishing infinite graphs
• Distinguishing graphs with intermediate growth
• Breaking graph symmetries by edge colourings
• Distinguishing labellings of group action on vector spaces and graphs
• A brief history of the classification of the finite simple groups
• Asymmetric trees with two prescribed degrees
• Distinguishing numbers of finite 4-valent vertex-transitive graphs
• Random Colourings and Automorphism Breaking in Locally Finite Graphs

This page was built for publication: Distinguishing infinite graphs with bounded degrees