Pages that link to "Item:Q1883683"
From MaRDI portal
The following pages link to Distinguishing numbers for graphs and groups (Q1883683):
Displaying 29 items.
- Distinguishing maps. II: General case (Q396760) (← links)
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Distinguishability of infinite groups and graphs (Q426906) (← links)
- Distinguishing maps (Q540028) (← links)
- Distinguishing labeling of the actions of almost simple groups. (Q663093) (← links)
- Automorphisms and distinguishing numbers of geometric cliques (Q938315) (← links)
- Distinguishing labeling of group actions (Q1024499) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- Symmetry breaking in graphs (Q1918875) (← links)
- Distinguishing index of maps (Q2011148) (← links)
- Labeling resolving sets (Q2223492) (← links)
- Distinguishing index of graphs with simple automorphism groups (Q2237852) (← links)
- The distinguishing number of quasiprimitive and semiprimitive groups (Q2311089) (← links)
- On the distinguishing number of functigraphs (Q2333653) (← links)
- Distinguishing number of countable homogeneous relational structures (Q2380452) (← links)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← 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)
- Labeling schemes for deterministic radio multi-broadcast (Q2672450) (← links)
- Distinguishing partitions of complete multipartite graphs (Q2810380) (← links)
- Labeling of Sets Under the Actions of $$\overrightarrow{{S}_{n}} $$ and $$\overrightarrow{{A}_{n}}$$ (Q2961591) (← links)
- Motion and distinguishing number two (Q3119058) (← links)
- Distinguishing partitions and asymmetric uniform hypergraphs (Q3119062) (← links)
- Generation of Colourings and Distinguishing Colourings of Graphs (Q3449807) (← links)
- Stabilizing the distinguishing number of a graph (Q4633988) (← links)
- The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs (Q5054038) (← links)
- On distinguishing labelling of sets under the wreath product action (Q6114162) (← links)
- Orbit closed permutation groups, relation groups, and simple groups (Q6156186) (← links)
