Pages that link to "Item:Q4520519"
From MaRDI portal
The following pages link to A note on the computability of graph minor obstruction sets for monadic second order ideals (Q4520519):
Displaying 9 items.
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- Minor obstructions for apex-pseudoforests (Q2043398) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)