Q4229265 (Q4229265): Difference between revisions

@@ Property / cites work @@
+Four classes of perfectly orderable graphs
@@ Property / cites work: Four classes of perfectly orderable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomially solvable cases for the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Components, Clusters and Slicings in Graphs
+Normal rank
@@ Property / cites work @@
+Smallest-last ordering and clustering and graph coloring algorithms
+Normal rank
@@ Property / cites work @@
+An inequality for the chromatic number of a graph
@@ Property / cites work: An inequality for the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank