Pages that link to "Item:Q2674345"
From MaRDI portal
The following pages link to A Stallings type theorem for quasi-transitive graphs (Q2674345):
Displaying 8 items.
- Cutting up graphs revisited – a short proof of Stallings' structure theorem (Q3085994) (← links)
- A descriptive construction of trees and Stallings’ theorem (Q3299567) (← links)
- (Q3807233) (← links)
- Two-ended quasi-transitive graphs (Q5057726) (← links)
- Self-avoiding walks and multiple context-free languages (Q5886265) (← links)
- Minor exclusion in quasi-transitive graphs (Q6056470) (← links)
- The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem (Q6615767) (← links)
- Quasi-transitive \(K_{\infty}\)-minor free graphs (Q6655686) (← links)