The following pages link to Symmetry breaking in graphs (Q1918875):
Displayed 30 items.
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Endomorphism breaking in graphs (Q405090) (← links)
- Orbit equivalence and permutation groups defined by unordered relations. (Q424390) (← links)
- Distinguishing graphs by edge-colourings (Q482130) (← links)
- Infinite graphs with finite 2-distinguishing cost (Q490268) (← links)
- Rigidity and separation indices of graphs in surfaces (Q604979) (← links)
- On the automorphic chromatic index of a graph (Q604996) (← links)
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859) (← links)
- Upper bounds for the automorphic chromatic index of a graph (Q742607) (← links)
- Bounding the distinguishing number of infinite graphs and permutation groups (Q743653) (← links)
- The distinguishing numbers of graphs on closed surfaces (Q764885) (← links)
- Cartesian powers of graphs can be distinguished by two labels (Q854831) (← links)
- Destroying automorphisms by fixing nodes (Q856873) (← links)
- Automorphisms and distinguishing numbers of geometric cliques (Q938315) (← links)
- The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
- Distinguishing labeling of group actions (Q1024499) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- deBruijn-like sequences and the irregular chromatic number of paths and cycles (Q1045102) (← links)
- On the local distinguishing numbers of cycles (Q1297401) (← links)
- The distinguishing number of the hypercube (Q1827766) (← links)
- Infinite motion and 2-distinguishability of graphs and groups (Q2256057) (← links)
- The distinguishing index of infinite graphs (Q2341071) (← links)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
- Distinguishing colorings of Cartesian products of complete graphs (Q2483404) (← links)
- The distinguishing number of the augmented cube and hypercube powers (Q2483424) (← links)
- The distinguishing number of the direct product and wreath product action. (Q2509195) (← links)
- Distinguishing labellings of group action on vector spaces and graphs (Q2509274) (← links)
- Effective storage capacity of labeled graphs (Q2637317) (← links)
- (Q2857409) (← links)
- The determining number of a Cartesian product (Q3632997) (← links)