Finding a smallest odd hole in a claw-free graph using global structure (Q2444540): Difference between revisions

@@ Property / cites work @@
+The monotone circuit complexity of Boolean functions
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring quasi-line graphs
@@ Property / cites work: Coloring quasi-line 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 @@
+Q3416248
@@ Property / cites work: Q3416248 / rank @@
+Normal rank
@@ Property / cites work @@
+Bull-free Berge graphs are perfect
@@ Property / cites work: Bull-free Berge graphs are perfect / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing claw-free perfect graphs
@@ Property / cites work: Recognizing claw-free perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+A strengthening of Ben Rebea's lemma
@@ Property / cites work: A strengthening of Ben Rebea's lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+Finding and counting small induced subgraphs efficiently
+Normal rank
@@ Property / cites work @@
+Q3740256
@@ Property / cites work: Q3740256 / 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 @@
+Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)
+Normal rank