Pages that link to "Item:Q2483404"
From MaRDI portal
The following pages link to Distinguishing colorings of Cartesian products of complete graphs (Q2483404):
Displayed 19 items.
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- The distinguishing number and distinguishing index of the lexicographic product of two graphs (Q1649920) (← links)
- On the distinguishing number of cyclic tournaments: towards the Albertson-Collins conjecture (Q2026341) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- A bound for the distinguishing index of regular graphs (Q2198979) (← links)
- Precise bounds for the distinguishing index of the Cartesian product (Q2357379) (← links)
- List-distinguishing Cartesian products of cliques (Q2421867) (← links)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
- Distinguishing number of hierarchical products of graphs (Q2662361) (← links)
- Distinguishing number and distinguishing index of neighbourhood corona of two graphs (Q3299359) (← links)
- Nordhaus-Gaddum type inequalities for the distinguishing index (Q3390050) (← links)
- The determining number of a Cartesian product (Q3632997) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
- An upper bound on the distinguishing index of graphs with minimum degree at least two (Q4969593) (← links)
- Distinguishing number and distinguishing index of certain graphs (Q5020420) (← links)
- The chromatic distinguishing index of certain graphs (Q5154569) (← links)
- On the comparison of the distinguishing coloring and the locating coloring of graphs (Q6095325) (← links)