Pages that link to "Item:Q1649920"
From MaRDI portal
The following pages link to The distinguishing number and distinguishing index of the lexicographic product of two graphs (Q1649920):
Displaying 8 items.
- Number of distinguishing colorings and partitions (Q776312) (← links)
- Proper distinguishing colorings with few colors for graphs with girth at least 5 (Q1658779) (← links)
- The distinguishing number and distinguishing chromatic number for posets (Q2088064) (← links)
- Distinguishing numbers and distinguishing indices of oriented graphs (Q2197442) (← links)
- Distinguishing index of Kronecker product of two graphs (Q4958047) (← links)
- The distinguishing number (index) and the domination number of a graph (Q4986551) (← links)
- Number of colors needed to break symmetries of a graph by an arbitrary edge coloring (Q5058213) (← links)
- Distinguishing threshold of graphs (Q6074586) (← links)