Closing complexity gaps for coloring problems on $H$-free graphs (Q2252529): Difference between revisions

@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring the complexity boundary between coloring and list-coloring
+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 @@
+Independent Sets in Asteroidal Triple-Free Graphs
@@ Property / cites work: Independent Sets in Asteroidal Triple-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of vertex colouring
@@ Property / cites work: Parameterized complexity of vertex colouring / rank @@
+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 @@
+Q3922703
@@ Property / cites work: Q3922703 / 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 @@
+Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Improved Complexity Results on k-Coloring P t -Free Graphs
+Normal rank
@@ Property / cites work @@
+Q4838466
@@ Property / cites work: Q4838466 / rank @@
+Normal rank
@@ Property / cites work @@
+Data Reduction for Graph Coloring Problems
@@ Property / cites work: Data Reduction for Graph Coloring Problems / 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 @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring AT-Free Graphs
@@ Property / cites work: Colouring AT-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3558598
@@ Property / cites work: Q3558598 / rank @@
+Normal rank
@@ Property / cites work @@
+Some results concerning the complexity of restricted colorings of graphs
+Normal rank
@@ Property / cites work @@
+Parameterized coloring problems on chordal graphs
@@ Property / cites work: Parameterized coloring problems on chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Precoloring extension on unit interval graphs
@@ Property / cites work: Precoloring extension on unit interval graphs / 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 @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+-colouring AT-free graphs in polynomial time
@@ Property / cites work: 3-colouring AT-free graphs in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Graph colorings with local constraints -- a survey
+Normal rank

Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529): Difference between revisions

Latest revision as of 18:12, 8 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)