Clique-perfectness of complements of line graphs (Q5891101): Difference between revisions

@@ Property / cites work @@
+Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
+Normal rank
@@ Property / cites work @@
+Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
+Normal rank
@@ Property / cites work @@
+Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Colouring the petals of a graph
@@ Property / cites work: Colouring the petals of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of clique-transversal and clique-independent sets
+Normal rank
@@ Property / cites work @@
+The chromatic index of a graph whose core has maximum degree two
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Distance-hereditary graphs are clique-perfect
@@ Property / cites work: Distance-hereditary graphs are clique-perfect / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank