Distinguishability of locally finite trees

zbMath1112.05026MaRDI QIDQ874003

Xiangqian Zhou, Mark E. Watkins

Publication date: 4 April 2007

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

Full work available at URL: https://eudml.org/doc/127338

zbMATH Keywords

chromatic numberdistinguishing number

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Related Items (19)

Paint cost and the frugal distinguishing number ⋮ Extending precolorings to distinguish group actions ⋮ Distinguishing graphs with intermediate growth ⋮ Trees with distinguishing index equal distinguishing number plus one ⋮ Breaking graph symmetries by edge colourings ⋮ Local finiteness, distinguishing numbers, and Tucker's conjecture ⋮ Nordhaus-Gaddum theorem for the distinguishing chromatic number ⋮ Distinguishing orthogonality graphs ⋮ Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) ⋮ Endomorphism breaking in graphs ⋮ Unnamed Item ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Infinite motion and 2-distinguishability of graphs and groups ⋮ The distinguishing chromatic number of Cartesian products of two complete graphs ⋮ On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture ⋮ The cost of 2-distinguishing hypercubes ⋮ Automorphisms of restricted parabolic trees and Sylow \(p\)-subgroups of the finitary symmetric group ⋮ Bounding the distinguishing number of infinite graphs and permutation groups ⋮ The distinguishing index of infinite graphs

This page was built for publication: Distinguishability of locally finite trees