Pages that link to "Item:Q490268"
From MaRDI portal
The following pages link to Infinite graphs with finite 2-distinguishing cost (Q490268):
Displaying 8 items.
- A note on the asymptotic and computational complexity of graph distinguishability (Q1385847) (← links)
- On a theorem of Halin (Q1688265) (← links)
- The cost of 2-distinguishing Cartesian powers (Q1953468) (← links)
- Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed (Q2153303) (← links)
- Distinguishing density and the distinct spheres condition (Q2198972) (← links)
- Distinguishing graphs with intermediate growth (Q2400107) (← links)
- Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density (Q5045282) (← links)
- Small label classes in 2-distinguishing labelings (Q5502846) (← links)