Clique or hole in claw-free graphs (Q765186): Difference between revisions

@@ Property / cites work @@
+On the complexity of testing for odd holes and induced odd paths
+Normal rank
@@ Property / cites work @@
+The three-in-a-tree problem
@@ Property / cites work: The three-in-a-tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3416248
@@ Property / cites work: Q3416248 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113764
@@ Property / cites work: Q3113764 / rank @@
+Normal rank
@@ Property / cites work @@
+One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
+Normal rank
@@ Property / cites work @@
+Detecting induced subgraphs
@@ Property / cites work: Detecting induced subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+Corrigendum to: On the complexity of testing for odd holes and induced odd paths
+Normal rank
@@ Property / cites work @@
+Decomposition by clique separators
@@ Property / cites work: Decomposition by clique separators / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding clique cut-sets
@@ Property / cites work: An algorithm for finding clique cut-sets / rank @@
+Normal rank
@@ Property / cites work @@
+Circuits containing specified edges
@@ Property / cites work: Circuits containing specified edges / rank @@
+Normal rank