Pages that link to "Item:Q426906"

The following pages link to Distinguishability of infinite groups and graphs (Q426906):

Displaying 25 items.

• Endomorphism breaking in graphs (Q405090) (← links)
• Distinguishing graphs by edge-colourings (Q482130) (← links)
• Distinguishing Cartesian products of countable graphs (Q503675) (← links)
• Bounding the distinguishing number of infinite graphs and permutation groups (Q743653) (← links)
• Local finiteness, distinguishing numbers, and Tucker's conjecture (Q888634) (← links)
• A note on computable distinguishing colorings (Q2030129) (← links)
• The cost of 2-distinguishing hypercubes (Q2037589) (← links)
• Symmetry parameters for Mycielskian graphs (Q2073195) (← links)
• Distinguishing density and the distinct spheres condition (Q2198972) (← links)
• Infinite motion and 2-distinguishability of graphs and groups (Q2256057) (← links)
• Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
• The distinguishing number of quasiprimitive and semiprimitive groups (Q2311089) (← links)
• The distinguishing index of infinite graphs (Q2341071) (← links)
• Distinguishing infinite graphs (Q2372880) (← links)
• Distinguishing number of countable homogeneous relational structures (Q2380452) (← links)
• Distinguishing graphs with intermediate growth (Q2400107) (← links)
• Breaking graph symmetries by edge colourings (Q2407385) (← links)
• Orbit-equivalent infinite permutation groups. (Q2435043) (← links)
• Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density (Q5045282) (← links)
• Paint cost and the frugal distinguishing number (Q5058214) (← links)
• Distinguishing Generalized Mycielskian Graphs (Q5090527) (← links)
• Reconstructing a minimal topological dynamical system from a set of return times (Q5095127) (← links)
• Distinguishability of a Semi-Group by a Machine (Q5729307) (← links)
• Working with Wilfried (Q5888907) (← links)
• Distinguishing orthogonality graphs (Q6056750) (← links)