Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047): Difference between revisions

@@ Property / cites work @@
+Three complexity results on coloring \(P_k\)-free graphs
+Normal rank
@@ Property / cites work @@
+A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on k-Colorability of P 5-Free Graphs
@@ Property / cites work: A Note on k-Colorability of P 5-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of 4-coloring graphs without long induced paths
+Normal rank
@@ Property / cites work @@
+-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
+Normal rank
@@ Property / cites work @@
+Q2770587
@@ Property / cites work: Q2770587 / rank @@
+Normal rank