Pages that link to "Item:Q874003"
From MaRDI portal
The following pages link to Distinguishability of locally finite trees (Q874003):
Displayed 19 items.
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Endomorphism breaking in graphs (Q405090) (← links)
- Bounding the distinguishing number of infinite graphs and permutation groups (Q743653) (← links)
- Local finiteness, distinguishing numbers, and Tucker's conjecture (Q888634) (← links)
- The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341) (← links)
- The cost of 2-distinguishing hypercubes (Q2037589) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) (Q2189429) (← links)
- Infinite motion and 2-distinguishability of graphs and groups (Q2256057) (← links)
- The distinguishing index of infinite graphs (Q2341071) (← links)
- Distinguishing graphs with intermediate growth (Q2400107) (← links)
- Breaking graph symmetries by edge colourings (Q2407385) (← links)
- Paint cost and the frugal distinguishing number (Q5058214) (← links)
- Distinguishing Generalized Mycielskian Graphs (Q5090527) (← links)
- (Q5888907) (← links)
- Automorphisms of restricted parabolic trees and Sylow \(p\)-subgroups of the finitary symmetric group (Q5964509) (← links)
- Distinguishing orthogonality graphs (Q6056750) (← links)