The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645): Difference between revisions

@@ Property / cites work @@
+On graphs with polynomially solvable maximum-weight clique problem
+Normal rank
@@ Property / cites work @@
+Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
+Normal rank
@@ Property / cites work @@
+Three-coloring and list three-coloring of graphs without induced paths on seven vertices
+Normal rank
@@ Property / cites work @@
+Updating the complexity status of coloring graphs without a fixed induced linear forest
+Normal rank
@@ Property / cites work @@
+The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness
+Normal rank
@@ Property / cites work @@
+Structure and algorithms for (cap, even hole)-free graphs
+Normal rank
@@ Property / cites work @@
+Colouring diamond-free graphs
@@ Property / cites work: Colouring diamond-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs
+Normal rank
@@ Property / cites work @@
+On coloring a class of claw-free graphs.
@@ Property / cites work: On coloring a class of claw-free graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection of two vertex coloring problems
@@ Property / cites work: The intersection of two vertex coloring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring square-free graphs without long induced paths
+Normal rank
@@ Property / cites work @@
+A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
+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 @@
+Complexity of coloring graphs without paths and cycles
+Normal rank
@@ Property / cites work @@
+Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
+Normal rank
@@ Property / cites work @@
+Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
+Normal rank
@@ Property / cites work @@
+Q5755526
@@ Property / cites work: Q5755526 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial cases for the vertex coloring problem
@@ Property / cites work: Polynomial cases for the vertex coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring \((P_r + P_s)\)-free graphs
@@ Property / cites work: Colouring \((P_r + P_s)\)-free graphs / rank @@
+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 @@
+The coloring problem for classes with two small obstructions
+Normal rank
@@ Property / cites work @@
+The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs
+Normal rank
@@ Property / cites work @@
+Two cases of polynomial-time solvability for the coloring problem
+Normal rank
@@ Property / cites work @@
+The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs
+Normal rank
@@ Property / cites work @@
+The weighted coloring problem for two graph classes characterized by small forbidden induced structures
+Normal rank
@@ Property / cites work @@
+Two complexity results for the vertex coloring problem
+Normal rank
@@ Property / cites work @@
+A complete classification of the complexity of the vertex 3-colourability problem for quadruples of induced 5-vertex prohibitions
+Normal rank
@@ Property / cites work @@
+On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size
+Normal rank
@@ Property / cites work @@
+Four-coloring <i>P</i><sub>6</sub>-free graphs
@@ Property / cites work: Four-coloring <i>P</i><sub>6</sub>-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition by clique separators
@@ Property / cites work: Decomposition by clique separators / rank @@
+Normal rank