Pages that link to "Item:Q2427541"
From MaRDI portal
The following pages link to The distinguishing number of Cartesian products of complete graphs (Q2427541):
Displaying 27 items.
- Nordhaus-Gaddum theorem for the distinguishing chromatic number (Q396886) (← links)
- Endomorphism breaking in graphs (Q405090) (← links)
- Distinguishing graphs by edge-colourings (Q482130) (← links)
- 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)
- 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)
- Trees with distinguishing number two (Q2176156) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- A bound for the distinguishing index of regular graphs (Q2198979) (← 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)
- Distinguishing colorings of Cartesian products of complete graphs (Q2483404) (← links)
- Distinguishing number of hierarchical products of graphs (Q2662361) (← 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)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- An upper bound on the distinguishing index of graphs with minimum degree at least two (Q4969593) (← links)
- Distinguishing number and distinguishing index of strong product of two graphs (Q4998754) (← links)
- The chromatic distinguishing index of certain graphs (Q5154569) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)
