A Characterization of b-Perfect Graphs (Q2911056): Difference between revisions

@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Weakly triangulated graphs
@@ Property / cites work: Weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for weakly chordal graphs
@@ Property / cites work: Improved algorithms for weakly chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(b\)-dominating coloring of graphs
@@ Property / cites work: On the \(b\)-dominating coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On minimally \(b\)-imperfect graphs
@@ Property / cites work: On minimally \(b\)-imperfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On b-perfect chordal graphs
@@ Property / cites work: On b-perfect chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128916
@@ Property / cites work: Q3128916 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of recognizing perfectly orderable graphs
+Normal rank
@@ Property / cites work @@
+On a property of the class of n-colorable graphs
@@ Property / cites work: On a property of the class of n-colorable graphs / rank @@
+Normal rank