Distinguishability of locally finite trees

zbMATH Open1112.05026MaRDI QIDQ874003FDOQ874003

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

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

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

zbMATH Keywords

chromatic numberdistinguishing number

Mathematics Subject Classification ID

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

Cited In (25)

• Local greatest equivalence classes of \(\omega\)-trees
• Extending precolorings to distinguish group actions
• Breaking graph symmetries by edge colourings
• List distinguishing parameters of trees
• Endomorphism breaking in graphs
• The distinguishing index of infinite graphs
• Distinguishing trees in linear time
• Title not available (Why is that?)
• Nordhaus-Gaddum theorem for the distinguishing chromatic number
• 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
• Local finiteness, distinguishing numbers, and Tucker's conjecture
• A counterexample to the reconstruction conjecture for locally finite trees
• Bounding the distinguishing number of infinite graphs and permutation groups
• Automorphisms of restricted parabolic trees and Sylow \(p\)-subgroups of the finitary symmetric group
• Paint cost and the frugal distinguishing number
• On computing the distinguishing numbers of trees and forests
• Infinite motion and 2-distinguishability of graphs and groups
• Distinguishing graphs with intermediate growth
• Distinguishing orthogonality graphs
• Title not available (Why is that?)
• Distinguishing generalized Mycielskian graphs
• Asymmetrizing trees of maximum valence \(2^{\aleph_0}\)
• Trees with distinguishing index equal distinguishing number plus one

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)