scientific article; zbMATH DE number 4133491
From MaRDI portal
Publication:3034816
Recommendations
Cited in
(23)- Structure and recognition of graphs with no 6-wheel subdivision
- The complexity of induced minors and related problems
- Few induced disjoint paths for \(H\)-free graphs
- The \(k\)-in-a-path problem for claw-free graphs
- Crossing number is hard for cubic graphs
- Induced disjoint paths in circular-arc graphs in linear time
- \(\mathrm P \overset {?} {=} \mathrm{NP}\)
- The birth and early years of parameterized complexity
- Fixed-parameter tractability of treewidth and pathwidth
- The Induced Disjoint Paths Problem
- scientific article; zbMATH DE number 4110103 (Why is no real title available?)
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- A linear time algorithm for the induced disjoint paths problem in planar graphs
- Mineurs d'arbres avec racines
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Non-interfering network flows
- Induced disjoint paths in claw-free graphs
- Induced disjoint paths and connected subgraphs for H-free graphs
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs
- Few induced disjoint paths for \(H\)-free graphs
- How I got to like graph polynomials
- Chordless paths through three vertices
- Comparing trees via crossing minimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3034816)
