Induced disjoint paths and connected subgraphs for \(H\)-free graphs
From MaRDI portal
Publication:6039437
DOI10.1007/978-3-031-15914-5_29arXiv2202.11595OpenAlexW4313026989MaRDI QIDQ6039437
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.11595
Related Items (3)
Induced disjoint paths and connected subgraphs for \(H\)-free graphs ⋮ Few induced disjoint paths for \(H\)-free graphs ⋮ Few induced disjoint paths for \(H\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A new characterization of \(P_k\)-free graphs
- A linear time algorithm for the induced disjoint paths problem in planar graphs
- A new characterization of \(P_{6}\)-free graphs
- Partitioning graphs into connected parts
- On maximal independent sets of vertices in claw-free graphs
- 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
- Two-segmented channel routing is strong NP-complete
- Graph minors. XIII: The disjoint paths problem
- Induced disjoint paths in AT-free graphs
- Few induced disjoint paths for \(H\)-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
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Induced disjoint paths in circular-arc graphs in linear time
- Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs
- Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
- Induced Disjoint Paths in Claw-Free Graphs
- The complexity of satisfiability problems
- Detecting induced subgraphs
- Disjoint paths and connected subgraphs for \(H\)-free graphs
- Connected vertex cover for \((sP_1+P_5)\)-free graphs
- Contracting to a longest path in H-free graphs
- Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time
This page was built for publication: Induced disjoint paths and connected subgraphs for \(H\)-free graphs
