Detecting fixed patterns in chordal graphs in polynomial time
From MaRDI portal
Publication:2249737
Recommendations
Cites work
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A note on contracting claw-free graphs
- Algorithmic graph theory and perfect graphs
- Containment relations in split graphs
- Contractibility and NP-completeness
- Contracting a chordal graph to a split graph or a tree
- Contraction checking in graphs on surfaces
- Edge contractions in subclasses of chordal graphs
- Finding contractions and induced minors in chordal graphs via disjoint paths
- Finding topological subgraphs is fixed-parameter tractable
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Graph Classes: A Survey
- Graph minors. XIII: The disjoint paths problem
- On graph contractions and induced minors
- On rigid circuit graphs
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- On the complexity of testing for odd holes and induced odd paths
- Parametrized complexity theory.
- Partitioning graphs into connected parts
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The \(k\)-in-a-path problem for claw-free graphs
- The complexity of induced minors and related problems
- The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
- The computational complexity of graph contractions II: Two tough polynomially solvable cases
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Treewidth. Computations and approximations
Cited in
(25)- Cops and robber on oriented graphs with respect to push operation
- Few induced disjoint paths for \(H\)-free graphs
- Few induced disjoint paths for \(H\)-free graphs
- Finding contractions and induced minors in chordal graphs via disjoint paths
- Containment relations in split graphs
- A note on contracting claw-free graphs
- On strictly chordality-\(k\) graphs
- The complexity of contracting bipartite graphs into small cycles
- The complexity of contracting bipartite graphs into small cycles
- Contracting a chordal graph to a split graph or a tree
- Contracting bipartite graphs to paths and cycles
- Induced disjoint paths in claw-free graphs
- Graph editing to a fixed target
- Detecting induced minors in AT-free graphs
- On graph contractions and induced minors
- Mim-width. I. Induced path problems
- The (theta, wheel)-free graphs. IV: Induced paths and cycles
- Contracting bipartite graphs to paths and cycles
- scientific article; zbMATH DE number 7765365 (Why is no real title available?)
- Induced disjoint paths in circular-arc graphs in linear time
- Induced disjoint paths and connected subgraphs for H-free graphs
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs
- Parameterized complexity of set-restricted disjoint paths on chordal graphs
- Edge contractions in subclasses of chordal graphs
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
This page was built for publication: Detecting fixed patterns in chordal graphs in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249737)
