The following pages link to (Q3034816):
Displaying 20 items.
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)
- The complexity of induced minors and related problems (Q1346772) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
- Crossing number is hard for cubic graphs (Q2496198) (← links)
- Induced disjoint paths in circular-arc graphs in linear time (Q2629233) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- Mineurs d'arbres avec racines (Q4858839) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- Non-interfering network flows (Q5056145) (← links)
- Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- How I got to like graph polynomials (Q6593617) (← links)
