On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579): Difference between revisions

@@ Property / cites work @@
+On graphs with polynomially solvable maximum-weight clique problem
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Three Complexity Results on Coloring P k -Free Graphs
+Normal rank
@@ Property / cites work @@
+Updating the complexity status of coloring graphs without a fixed induced linear forest
+Normal rank
@@ Property / cites work @@
+Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
+Normal rank
@@ Property / cites work @@
+List Coloring in the Absence of a Linear Forest
@@ Property / cites work: List Coloring in the Absence of a Linear Forest / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring Vertices of Triangle-Free Graphs
@@ Property / cites work: Colouring Vertices of Triangle-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+-Coloring H-Free Graphs When H Is Small
@@ Property / cites work: 4-Coloring H-Free Graphs When H Is Small / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216686
@@ Property / cites work: Q3216686 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
+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 @@
+Generalized coloring for tree-like graphs
@@ Property / cites work: Generalized coloring for tree-like graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3558598
@@ Property / cites work: Q3558598 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5755526
@@ Property / cites work: Q5755526 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4838453
@@ Property / cites work: Q4838453 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of 4-coloring graphs without long induced paths
+Normal rank
@@ Property / cites work @@
+NP completeness of finding the chromatic index of regular graphs
+Normal rank
@@ Property / cites work @@
+On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
+Normal rank
@@ Property / cites work @@
+Vertex colouring and forbidden subgraphs -- a survey
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / cites work @@
+Graph colorings with local constraints -- a survey
+Normal rank
@@ Property / cites work @@
+Q2770587
@@ Property / cites work: Q2770587 / rank @@
+Normal rank