Few induced disjoint paths for \(H\)-free graphs
From MaRDI portal
Publication:2098179
DOI10.1016/j.tcs.2022.10.024OpenAlexW4307288260MaRDI QIDQ2098179
Erik Jan van Leeuwen, Daniël Paulusma, Siani Smith, Barnaby Martin
Publication date: 17 November 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.03319
Related Items (2)
Induced disjoint paths and connected subgraphs for \(H\)-free graphs ⋮ Induced disjoint paths and connected subgraphs for \(H\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A linear time algorithm for the induced disjoint paths problem in planar graphs
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Parameterized complexity of independent set in H-free graphs
- Chordless paths through three vertices
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- On the complexity of testing for odd holes and induced odd paths
- Graph minors. XIII: The disjoint paths problem
- Induced disjoint paths in AT-free graphs
- Mim-width. I. Induced path problems
- The (theta, wheel)-free graphs. IV: Induced paths and cycles
- Detecting fixed patterns in chordal graphs in polynomial time
- The \(k\)-in-a-path problem for claw-free graphs
- Induced disjoint paths in circular-arc graphs in linear time
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Colouring H-free graphs of bounded diameter.
- Induced Disjoint Paths in Claw-Free Graphs
- Detecting induced subgraphs
- Disjoint paths and connected subgraphs for \(H\)-free graphs
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs
- Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs
This page was built for publication: Few induced disjoint paths for \(H\)-free graphs
