Pages that link to "Item:Q5898352"
From MaRDI portal
The following pages link to Distinguishing Cartesian powers of graphs (Q5898352):
Displaying 32 items.
- Distinguishing Cartesian products of countable graphs (Q503675) (← links)
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- Distinguishing chromatic numbers of complements of Cartesian products of complete graphs (Q724854) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← links)
- Automorphisms and distinguishing numbers of geometric cliques (Q938315) (← links)
- The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
- Connectivity of Cartesian products of graphs (Q998569) (← links)
- deBruijn-like sequences and the irregular chromatic number of paths and cycles (Q1045102) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- Asymmetric colorings of products of graphs and digraphs (Q2026319) (← 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)
- Trees with distinguishing number two (Q2176156) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- Precise bounds for the distinguishing index of the Cartesian product (Q2357379) (← links)
- Distinguishing graphs with intermediate growth (Q2400107) (← 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)
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS (Q3521581) (← links)
- The determining number of a Cartesian product (Q3632997) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- Distinguishing number and distinguishing index of strong product of two graphs (Q4998754) (← 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)
- (Q5888907) (← links)
- Distinguishing orthogonality graphs (Q6056750) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
