Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2013.12.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2107830209
@@ Property / OpenAlex ID: W2107830209 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width for 4-vertex forbidden subgraphs
@@ Property / cites work: Clique-width for 4-vertex forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure of (\(P_{5}\),\,gem)-free graphs
@@ Property / cites work: On the structure of (\(P_{5}\),\,gem)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
+Normal rank
@@ Property / cites work @@
+Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Updating the complexity status of coloring graphs without a fixed induced linear forest
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / 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 @@
+On the parameterized complexity of coloring graphs in the absence of a linear forest
+Normal rank
@@ Property / cites work @@
+Colouring of Graphs with Ramsey-Type Forbidden Subgraphs
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
+Normal rank
@@ Property / cites work @@
+Colouring vertices of triangle-free graphs without forests
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+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 @@
+-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 @@
+Closing Complexity Gaps for Coloring Problems on H-Free Graphs
+Normal rank
@@ Property / cites work @@
+Coloring the hypergraph of maximal cliques of a graph with no long path
+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 @@
+A Characterization of b-Perfect Graphs
@@ Property / cites work: A Characterization of b-Perfect Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Complexity Results on k-Coloring P t -Free Graphs
+Normal rank
@@ Property / cites work @@
+Recent developments on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Edge dominating set and colorings on graphs with fixed clique-width
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
+Normal rank
@@ Property / cites work @@
+THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
+Normal rank
@@ Property / cites work @@
+On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S
+Normal rank
@@ Property / cites work @@
+The coloring problem for classes with two small obstructions
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+-colorability and forbidden subgraphs. I: Characterizing pairs
+Normal rank
@@ Property / cites work @@
+Q4780499
@@ Property / cites work: Q4780499 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex colouring and forbidden subgraphs -- a survey
+Normal rank
@@ Property / cites work @@
+Some new hereditary classes where graph coloring remains NP-hard
+Normal rank
@@ Property / cites work @@
+Graph colorings with local constraints -- a survey
+Normal rank