Pages that link to "Item:Q6081887"
From MaRDI portal
The following pages link to Distinguishing infinite graphs with bounded degrees (Q6081887):
Displaying 15 items.
- Infinite graphs with finite 2-distinguishing cost (Q490268) (← links)
- Local finiteness, distinguishing numbers, and Tucker's conjecture (Q888634) (← links)
- On a theorem of Halin (Q1688265) (← links)
- On asymmetric colourings of claw-free graphs (Q2048557) (← 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 of maximum valence 3 (Q2278113) (← links)
- Bounds for distinguishing invariants of infinite graphs (Q2363696) (← links)
- Distinguishing infinite graphs (Q2372880) (← links)
- Distinguishing graphs with intermediate growth (Q2400107) (← links)
- Bounded-degree graphs can have arbitrarily large slope numbers (Q2583679) (← links)
- Distinguishing graphs with infinite motion and nonlinear growth (Q3191457) (← links)
- Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty (Q5236227) (← links)
- The role of the Axiom of Choice in proper and distinguishing colourings (Q5881017) (← links)
- Asymmetric colouring of locally compact permutation groups (Q6096835) (← links)