Few induced disjoint paths for H-free graphs
From MaRDI portal
Recommendations
Cites work
- A linear time algorithm for the induced disjoint paths problem in planar graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
- Detecting fixed patterns in chordal graphs in polynomial time
- Disjoint paths and connected subgraphs for \(H\)-free graphs
- Graph minors. XIII: The disjoint paths problem
- scientific article; zbMATH DE number 4133491 (Why is no real title available?)
- Induced disjoint paths and connected subgraphs for H-free graphs
- Induced disjoint paths in circular-arc graphs in linear time
- Induced disjoint paths in claw-free graphs
- Mim-width. I. Induced path problems
- On the complexity of testing for odd holes and induced odd paths
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- The (theta, wheel)-free graphs. IV: Induced paths and cycles
- The \(k\)-in-a-path problem for claw-free graphs
Cited in
(4)
This page was built for publication: Few induced disjoint paths for \(H\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166893)