Pages that link to "Item:Q2380452"
From MaRDI portal
The following pages link to Distinguishing number of countable homogeneous relational structures (Q2380452):
Displaying 17 items.
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Orbit equivalence and permutation groups defined by unordered relations. (Q424390) (← links)
- Distinguishing number and adjacency properties (Q543989) (← links)
- Local finiteness, distinguishing numbers, and Tucker's conjecture (Q888634) (← links)
- On countable stable structures which are homogeneous for a finite relational language (Q1084097) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341) (← links)
- A note on computable distinguishing colorings (Q2030129) (← links)
- Distinguishing number of universal homogeneous Urysohn metric spaces (Q2088703) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- Infinite motion and 2-distinguishability of graphs and groups (Q2256057) (← links)
- Distinguishing graphs with intermediate growth (Q2400107) (← links)
- Orbit-equivalent infinite permutation groups. (Q2435043) (← links)
- Distinguishing geometric graphs (Q3419706) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
