Two cases of polynomial-time solvability for the coloring problem (Q5963654): Difference between revisions

@@ Property / cites work @@
+A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
+Normal rank
@@ Property / cites work @@
+Colouring vertices of triangle-free graphs without forests
+Normal rank
@@ Property / cites work @@
+Colouring of graphs with Ramsey-type forbidden subgraphs
+Normal rank
@@ Property / cites work @@
+List Coloring in the Absence of Two Subgraphs
@@ Property / cites work: List Coloring in the Absence of Two Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5749319
@@ Property / cites work: Q5749319 / 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 @@
+Boundary properties of graphs for algorithmic graph problems
+Normal rank
@@ Property / cites work @@
+Characterizations and recognition of circular-arc graphs and subclasses: a survey
+Normal rank
@@ Property / cites work @@
+Vertex coloring of graphs with few obstructions
@@ Property / cites work: Vertex coloring of graphs with few obstructions / rank @@
+Normal rank
@@ Property / cites work @@
+Some new hereditary classes where graph coloring remains NP-hard
+Normal rank
@@ Property / cites work @@
+On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Q5263782
@@ Property / cites work: Q5263782 / rank @@
+Normal rank
@@ Property / cites work @@
+The coloring problem for classes with two small obstructions
+Normal rank
@@ Property / cites work @@
+Sur le coloriage des graphs
@@ Property / cites work: Sur le coloriage des graphs / rank @@
+Normal rank