The following pages link to Distinguishing maps (Q540028):
Displaying 31 items.
- Distinguishing maps. II: General case (Q396760) (← links)
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Endomorphism breaking in graphs (Q405090) (← links)
- The distinguishing numbers of graphs on closed surfaces (Q764885) (← links)
- On symmetries of edge and vertex colourings of graphs (Q776279) (← links)
- Local finiteness, distinguishing numbers, and Tucker's conjecture (Q888634) (← links)
- 3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions (Q897252) (← links)
- Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions (Q1696528) (← links)
- Distinguishing index of maps (Q2011148) (← links)
- On asymmetric colourings of claw-free graphs (Q2048557) (← 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)
- Double standard maps (Q2385032) (← links)
- Distinguishing graphs with intermediate growth (Q2400107) (← links)
- Breaking graph symmetries by edge colourings (Q2407385) (← links)
- The distinguishing number of the direct product and wreath product action. (Q2509195) (← links)
- Mixed Map Labeling (Q2947031) (← links)
- Motion and distinguishing number two (Q3119058) (← links)
- (Q3128798) (← links)
- Spatial discrimination and classification maps (Q3727156) (← links)
- (Q4352247) (← links)
- Coarse distinguishability of graphs with symmetric growth (Q5013344) (← links)
- (Q5429716) (← links)
- Working with Wilfried (Q5888907) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
- Distinguishing infinite graphs with bounded degrees (Q6081887) (← links)
- Asymmetric colouring of locally compact permutation groups (Q6096835) (← links)
