Distinguishability of locally finite trees

MaRDI QIDQ874003zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r29.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

chromatic numberdistinguishing number

Mathematics Subject Classification ID

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

Recommendations

• Trees with distinguishing number two
• List distinguishing parameters of trees
• Distinguishing infinite graphs
• The distinguishing chromatic number
• Trees with distinguishing index equal distinguishing number plus one

Cited in

(25)

• scientific article; zbMATH DE number 1472093 (Why is no real title available?)
• Distinguishing generalized Mycielskian graphs
• Extending precolorings to distinguish group actions
• On computing the distinguishing numbers of trees and forests
• Local finiteness, distinguishing numbers, and Tucker's conjecture
• Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)
• The cost of 2-distinguishing hypercubes
• scientific article; zbMATH DE number 7678748 (Why is no real title available?)
• Distinguishing trees in linear time
• List distinguishing parameters of trees
• Paint cost and the frugal distinguishing number
• On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture
• Endomorphism breaking in graphs
• A counterexample to the reconstruction conjecture for locally finite trees
• Automorphisms of restricted parabolic trees and Sylow \(p\)-subgroups of the finitary symmetric group
• The distinguishing chromatic number of Cartesian products of two complete graphs
• Bounding the distinguishing number of infinite graphs and permutation groups
• Local greatest equivalence classes of \(\omega\)-trees
• Nordhaus-Gaddum theorem for the distinguishing chromatic number
• Infinite motion and 2-distinguishability of graphs and groups
• Trees with distinguishing index equal distinguishing number plus one
• Distinguishing orthogonality graphs
• The distinguishing index of infinite graphs
• Breaking graph symmetries by edge colourings
• Distinguishing graphs with intermediate growth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874003)