Pages that link to "Item:Q2075169"
From MaRDI portal
The following pages link to The complexity of orientable graph manifolds (Q2075169):
Displaying 5 items.
- Complexity of discrete Seifert foliations over a graph (Q2332088) (← links)
- Complexity dichotomy for oriented homomorphism of planar graphs with large girth (Q2355705) (← links)
- Upper complexity bounds for an infinite family of graph-manifolds (Q2454494) (← links)
- On the complexity of graph-manifolds (Q2498125) (← links)
- Computing Matveev's complexity via crystallization theory: the orientable case (Q2509163) (← links)