Pages that link to "Item:Q854831"

The following pages link to Cartesian powers of graphs can be distinguished by two labels (Q854831):

Displaying 21 items.

• Distinguishing Cartesian products of countable graphs (Q503675) (← links)
• The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
• Automorphisms and distinguishing numbers of geometric cliques (Q938315) (← links)
• The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
• The distinguishing number and distinguishing index of the lexicographic product of two graphs (Q1649920) (← links)
• The list distinguishing number of Kneser graphs (Q1693128) (← 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)
• Precise bounds for the distinguishing index of the Cartesian product (Q2357379) (← links)
• Distinguishing graphs with intermediate growth (Q2400107) (← 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)
• The distinguishing number of the augmented cube and hypercube powers (Q2483424) (← links)
• Distinguishing number and distinguishing index of neighbourhood corona of two graphs (Q3299359) (← links)
• Paint cost and the frugal distinguishing number (Q5058214) (← links)
• Symmetry parameters of various hypercube families (Q5058218) (← links)
• Distinguishing orthogonality graphs (Q6056750) (← links)