The following pages link to Distinguishing infinite graphs (Q2372880):
Displaying 41 items.
- Endomorphism breaking in graphs (Q405090) (← links)
- Distinguishability of infinite groups and graphs (Q426906) (← links)
- Infinite graphs with finite 2-distinguishing cost (Q490268) (← links)
- Distinguishing Cartesian products of countable graphs (Q503675) (← links)
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- Distinguishing number and adjacency properties (Q543989) (← links)
- Bounding the distinguishing number of infinite graphs and permutation groups (Q743653) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← links)
- Distinguishability of locally finite trees (Q874003) (← 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 a theorem of Halin (Q1688265) (← links)
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341) (← links)
- A note on computable distinguishing colorings (Q2030129) (← links)
- The cost of 2-distinguishing hypercubes (Q2037589) (← links)
- On asymmetric colourings of claw-free graphs (Q2048557) (← links)
- Symmetry parameters for Mycielskian graphs (Q2073195) (← links)
- Distinguishing number of universal homogeneous Urysohn metric spaces (Q2088703) (← links)
- Equitable distinguishing chromatic number (Q2147524) (← links)
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed (Q2153303) (← links)
- Asymmetrizing trees of maximum valence \(2^{\aleph_0}\) (Q2189429) (← links)
- Infinite motion and 2-distinguishability of graphs and groups (Q2256057) (← links)
- Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
- The distinguishing index of infinite graphs (Q2341071) (← links)
- Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
- Distinguishing number of countable homogeneous relational structures (Q2380452) (← links)
- Breaking graph symmetries by edge colourings (Q2407385) (← links)
- Distinguishing number of hierarchical products of graphs (Q2662361) (← links)
- Distinguishing graphs with infinite motion and nonlinear growth (Q3191457) (← links)
- On distinquishing numbers (Q3633835) (← links)
- Graphoidally independent infinite graphs (Q5016218) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- Paint cost and the frugal distinguishing number (Q5058214) (← links)
- Distinguishing Generalized Mycielskian Graphs (Q5090527) (← links)
- A rigid Urysohn-like metric space (Q5274761) (← links)
- Working with Wilfried (Q5888907) (← links)
- Distinguishing orthogonality graphs (Q6056750) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
- Distinguishing infinite graphs with bounded degrees (Q6081887) (← links)
- Asymmetric colouring of locally compact permutation groups (Q6096835) (← links)
