Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (Q2804992): Difference between revisions

@@ Property / cites work @@
+Compositions of Graphs and Polyhedra II: Stable Sets
+Normal rank
@@ Property / cites work @@
+Polytope des independants d'un graphe série-parallèle
+Normal rank
@@ Property / cites work @@
+<i>t</i>-Perfection Is Always Strong for Claw-Free Graphs
+Normal rank
@@ Property / cites work @@
+On claw-free \(t\)-perfect graphs
@@ Property / cites work: On claw-free \(t\)-perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471338
@@ Property / cites work: Q4471338 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of induced minors and related problems
+Normal rank
@@ Property / cites work @@
+Transformations which Preserve Perfectness and H-Perfectness of Graphs
+Normal rank
@@ Property / cites work @@
+The Graphs with All Subgraphs T-Perfect
@@ Property / cites work: The Graphs with All Subgraphs T-Perfect / rank @@
+Normal rank
@@ Property / cites work @@
+Induced Disjoint Paths in Claw-Free Graphs
@@ Property / cites work: Induced Disjoint Paths in Claw-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The disjoint paths problem in quadratic time
@@ Property / cites work: The disjoint paths problem in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417627
@@ Property / cites work: Q5417627 / rank @@
+Normal rank
@@ Property / cites work @@
+The Graph Minor Algorithm with Parity Conditions
@@ Property / cites work: The Graph Minor Algorithm with Parity Conditions / rank @@
+Normal rank
@@ Property / cites work @@
+Q2999655
@@ Property / cites work: Q2999655 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Perfectly Contractile Graphs
@@ Property / cites work: Algorithms for Perfectly Contractile Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect zero–one matrices
@@ Property / cites work: Perfect zero–one matrices / 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 @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+Normal rank
@@ Property / cites work @@
+A class of h-perfect graphs
@@ Property / cites work: A class of h-perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Strong T-Perfection of Bad-<i>K</i><sub>4</sub> -Free Graphs
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Applying Lehman's theorems to packing problems
@@ Property / cites work: Applying Lehman's theorems to packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the 2-disjoint paths problem in nearly linear time
+Normal rank
@@ Property / cites work @@
+Finding induced paths of given parity in claw-free graphs
+Normal rank