Detecting fixed patterns in chordal graphs in polynomial time (Q2249737): Difference between revisions

@@ Property / author @@
-Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
-Normal rank
@@ Property / author @@
-Marcin Kaminski
@@ Property / author: Marcin Kaminski / rank @@
-Normal rank
@@ Property / author @@
+Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
+Normal rank
@@ Property / author @@
+Marcin Kaminski
@@ Property / author: Marcin Kaminski / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+symrcm
@@ Property / describes a project that uses: symrcm / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2003458989
@@ Property / OpenAlex ID: W2003458989 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
+Normal rank
@@ Property / cites work @@
+Edge Contractions in Subclasses of Chordal Graphs
@@ Property / cites work: Edge Contractions in Subclasses of Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of testing for odd holes and induced odd paths
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Contractibility and NP-completeness
@@ Property / cites work: Contractibility and NP-completeness / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+The \(k\)-in-a-path problem for claw-free graphs
@@ Property / cites work: The \(k\)-in-a-path problem for claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5747399
@@ Property / cites work: Q5747399 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of induced minors and related problems
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+Q3664299
@@ Property / cites work: Q3664299 / rank @@
+Normal rank
@@ Property / cites work @@
+Contracting a Chordal Graph to a Split Graph or a Tree
+Normal rank
@@ Property / cites work @@
+Containment relations in split graphs
@@ Property / cites work: Containment relations in split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding topological subgraphs is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+On graph contractions and induced minors
@@ Property / cites work: On graph contractions and induced minors / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning graphs into connected parts
@@ Property / cites work: Partitioning graphs into connected parts / rank @@
+Normal rank
@@ Property / cites work @@
+Q2904760
@@ Property / cites work: Q2904760 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting induced subgraphs
@@ Property / cites work: Detecting induced subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
+Normal rank
@@ Property / cites work @@
+The computational complexity of graph contractions II: Two tough polynomially solvable cases
+Normal rank
@@ Property / cites work @@
+On the complexity of finding iso- and other morphisms for partial \(k\)- trees
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4792088
@@ Property / cites work: Q4792088 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank