Pages that link to "Item:Q5931419"
From MaRDI portal
The following pages link to A weak immersion relation on graphs and its applications (Q5931419):
Displaying 9 items.
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Complete graph immersions in dense graphs (Q512586) (← links)
- Cutwidth: obstructions and algorithmic aspects (Q1725643) (← links)
- Splitter theorems for 4-regular graphs (Q1959710) (← links)
- Constructing graphs with no immersion of large complete graphs (Q2922213) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- Fast Algorithms forK4Immersion Testing (Q4238533) (← links)
- Lean Tree-Cut Decompositions: Obstructions and Algorithms (Q5090482) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)