The following pages link to Endomorphism breaking in graphs (Q405090):
Displaying 5 items.
- Distinguishing graphs by edge-colourings (Q482130) (← links)
- The list distinguishing number of Kneser graphs (Q1693128) (← links)
- The distinguishing index of infinite graphs (Q2341071) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
