Pages that link to "Item:Q503675"
From MaRDI portal
The following pages link to Distinguishing Cartesian products of countable graphs (Q503675):
Displaying 26 items.
- Endomorphism breaking in graphs (Q405090) (← links)
- Distinguishing number and adjacency properties (Q543989) (← links)
- Recognizing triangulated Cartesian graph products (Q658038) (← links)
- Number of distinguishing colorings and partitions (Q776312) (← links)
- Cartesian powers of graphs can be distinguished by two labels (Q854831) (← 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)
- A note on computable distinguishing colorings (Q2030129) (← links)
- Trees with distinguishing index equal distinguishing number plus one (Q2175243) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
- Precise bounds for the distinguishing index of the Cartesian product (Q2357379) (← links)
- Distinguishing number of countable homogeneous relational structures (Q2380452) (← 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)
- Distinguishing number of hierarchical products of graphs (Q2662361) (← links)
- Distinguishing numbers of Cartesian products of multiple complete graphs (Q2892016) (← links)
- Game distinguishing numbers of Cartesian products (Q3174793) (← links)
- On distinquishing numbers (Q3633835) (← links)
- The distinguishing index of the Cartesian product of countable graphs (Q4597478) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
- THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH (Q4956581) (← links)
- The distinguishing index of the Cartesian product of finite graphs (Q5357290) (← links)
- Distinguishing Cartesian powers of graphs (Q5898352) (← links)
- Distinguishing Cartesian powers of graphs (Q5921670) (← links)
