Colouring vertices of triangle-free graphs without forests (Q764907): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2011.12.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2077936668
@@ Property / OpenAlex ID: W2077936668 / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs with polynomially solvable maximum-weight clique problem
+Normal rank
@@ Property / cites work @@
+A 4-colour problem for dense triangle-free graphs
@@ Property / cites work: A 4-colour problem for dense triangle-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Triangle-free graphs and forbidden subgraphs
@@ Property / cites work: Triangle-free graphs and forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387674
@@ Property / cites work: Q5387674 / rank @@
+Normal rank
@@ Property / cites work @@
+Three Complexity Results on Coloring P k -Free Graphs
+Normal rank
@@ Property / cites work @@
+On Coloring Graphs without Induced Forests
@@ Property / cites work: On Coloring Graphs without Induced Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
+Normal rank
@@ Property / cites work @@
+The structure of bull-free graphs II and III -- a summary
+Normal rank
@@ Property / cites work @@
+The Erdős-Hajnal conjecture for bull-free graphs
@@ Property / cites work: The Erdős-Hajnal conjecture for bull-free graphs / rank @@
+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 @@
+Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
+Normal rank
@@ Property / cites work @@
+Optimizing Bull-Free Perfect Graphs
@@ Property / cites work: Optimizing Bull-Free Perfect Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / 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 @@
+Q3558598
@@ Property / cites work: Q3558598 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5755526
@@ Property / cites work: Q5755526 / rank @@
+Normal rank
@@ Property / cites work @@
+Recent developments on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+The 3-Colorability Problem on Graphs with Maximum Degree Four
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of 4-coloring graphs without long induced paths
+Normal rank
@@ Property / cites work @@
+Coloring Bull-Free Perfectly Contractile Graphs
@@ Property / cites work: Coloring Bull-Free Perfectly Contractile Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite graphs without a skew star
@@ Property / cites work: Bipartite graphs without a skew star / rank @@
+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 @@
+Paw-free graphs
@@ Property / cites work: Paw-free graphs / 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 @@
+-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
+Normal rank
@@ Property / cites work @@
+Three-colourability and forbidden subgraphs. II: Polynomial algorithms
+Normal rank
@@ Property / cites work @@
+MSOL partitioning problems on graphs of bounded treewidth and clique-width
+Normal rank
@@ Property / cites work @@
+Some new hereditary classes where graph coloring remains NP-hard
+Normal rank
@@ Property / cites work @@
+Q2770587
@@ Property / cites work: Q2770587 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank