Pages that link to "Item:Q5921670"
From MaRDI portal
The following pages link to Distinguishing Cartesian powers of graphs (Q5921670):
Displayed 23 items.
- 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)
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs (Q724854) (← 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)
- 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)
- Infinite motion and 2-distinguishability of graphs and groups (Q2256057) (← links)
- On the distinguishing number of functigraphs (Q2333653) (← links)
- List-distinguishing Cartesian products of cliques (Q2421867) (← links)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
- Distinguishing colorings of Cartesian products of complete graphs (Q2483404) (← links)
- Effective storage capacity of labeled graphs (Q2637317) (← links)
- Distinguishing number and distinguishing index of certain graphs (Q5020420) (← 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)