The following pages link to Symmetry breaking in graphs (Q1918875):
Displayed 50 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- 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)
- Distinguishing Cartesian products of countable graphs (Q503675) (← links)
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- Edge motion and the distinguishing index (Q526904) (← 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)
- On symmetries of edge and vertex colourings of graphs (Q776279) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← links)
- Edge-distinguishing of star-free graphs (Q785585) (← links)
- Cartesian powers of graphs can be distinguished by two labels (Q854831) (← links)
- Destroying automorphisms by fixing nodes (Q856873) (← links)
- Local finiteness, distinguishing numbers, and Tucker's conjecture (Q888634) (← 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)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- A proof of Pyber's base size conjecture (Q1647396) (← links)
- The distinguishing number and distinguishing index of the lexicographic product of two graphs (Q1649920) (← links)
- On a theorem of Halin (Q1688265) (← links)
- The list distinguishing number of Kneser graphs (Q1693128) (← links)
- The distinguishing number of the hypercube (Q1827766) (← links)
- Pairings and related symmetry notions (Q1989479) (← links)
- Distinguishing index of maps (Q2011148) (← links)
- Graphs and their associated inverse semigroups (Q2012528) (← links)
- Distinguishing chromatic number of random Cayley graphs (Q2012532) (← links)
- Asymmetric colorings of products of graphs and digraphs (Q2026319) (← 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)
- Proper distinguishing arc-colourings of symmetric digraphs (Q2079126) (← links)
- The distinguishing number and distinguishing chromatic number for posets (Q2088064) (← 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)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Trees with distinguishing number two (Q2176156) (← links)