The following pages link to The Cost of Distinguishing Graphs (Q5365544):
Displaying 8 items.
- Random subgraphs make identification affordable (Q501982) (← links)
- A note on the asymptotic and computational complexity of graph distinguishability (Q1385847) (← links)
- The cost of 2-distinguishing hypercubes (Q2037589) (← links)
- Symmetry parameters for Mycielskian graphs (Q2073195) (← links)
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed (Q2153303) (← links)
- Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
- Coarse distinguishability of graphs with symmetric growth (Q5013344) (← links)
- Paint cost and the frugal distinguishing number (Q5058214) (← links)