Pages that link to "Item:Q1827766"
From MaRDI portal
The following pages link to The distinguishing number of the hypercube (Q1827766):
Displayed 29 items.
- The distinguishing numbers of graphs on closed surfaces (Q764885) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← links)
- Cartesian powers of graphs can be distinguished by two labels (Q854831) (← 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)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341) (← links)
- The cost of 2-distinguishing hypercubes (Q2037589) (← links)
- Symmetry parameters for Mycielskian graphs (Q2073195) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- The clique distribution in powers of hypercubes (Q2235258) (← links)
- On the distinguishing number of functigraphs (Q2333653) (← 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)
- Distinguishing number of hierarchical products of graphs (Q2662361) (← links)
- Generation of Colourings and Distinguishing Colourings of Graphs (Q3449807) (← links)
- The determining number of a Cartesian product (Q3632997) (← links)
- Distinguishing numbers of finite 4-valent vertex-transitive graphs (Q4993953) (← links)
- Distinguishing number and distinguishing index of certain graphs (Q5020420) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- Paint cost and the frugal distinguishing number (Q5058214) (← links)
- Symmetry parameters of various hypercube families (Q5058218) (← links)
- Distinguishing Generalized Mycielskian Graphs (Q5090527) (← links)
- Distinguishing orthogonality graphs (Q6056750) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)