Pages that link to "Item:Q1410732"
From MaRDI portal
The following pages link to Graph minors. XVIII: Tree-decompositions and well-quasi-ordering (Q1410732):
Displayed 16 items.
- Graph minors. XX: Wagner's conjecture (Q705888) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- On well-quasi-ordering finite structures with labels (Q912875) (← links)
- Graph minors XXIII. Nash-Williams' immersion conjecture (Q965247) (← links)
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← links)
- String graphs. I: The number of critical nonstring graphs is infinite (Q1121917) (← links)
- The structure of \(TK_ a\)-free graphs (Q1193564) (← links)
- The complexity of induced minors and related problems (Q1346772) (← links)
- Graph minors. XIX: Well-quasi-ordering on a surface. (Q1426103) (← links)
- Simplicial tree-decompositions of infinite graphs. I (Q2641316) (← links)
- The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Upper Bounds on the Graph Minor Theorem (Q3295150) (← links)
- Graph minor theory (Q3372389) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)