The following pages link to The distinguishing chromatic number (Q815210):
Displayed 14 items.
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Endomorphism breaking in graphs (Q405090) (← links)
- Distinguishing graphs by edge-colourings (Q482130) (← 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)
- Automorphisms and distinguishing numbers of geometric cliques (Q938315) (← links)
- The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← 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)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
- The distinguishing number of the augmented cube and hypercube powers (Q2483424) (← links)
- Distinguishing labellings of group action on vector spaces and graphs (Q2509274) (← links)