Colouring (P_r+P_s)-Free Graphs (Q5090995): Difference between revisions

@@ label / en / label / en @@
+Colouring (P_r+P_s)-Free Graphs
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Independent Feedback Vertex Set for P_5-free Graphs
+Normal rank
@@ Property / cites work @@
+Three-coloring and list three-coloring of graphs without induced paths on seven vertices
+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 @@
+Q4589007
@@ Property / cites work: Q4589007 / rank @@
+Normal rank
@@ Property / cites work @@
+‐Coloring             <i>P</i>             <sub>6</sub>             ‐Free Graphs with No Induced 5‐Cycles
+Normal rank
@@ Property / cites work @@
+Triangle-free graphs with no six-vertex induced path
+Normal rank
@@ Property / cites work @@
+-Colorable Subclasses of $P_8$-Free Graphs
@@ Property / cites work: 3-Colorable Subclasses of $P_8$-Free 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 colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs
+Normal rank
@@ Property / cites work @@
+The complexity of colouring problems on dense graphs
+Normal rank
@@ Property / cites work @@
+Uniquely Colourable Graphs and  the Hardness of Colouring Graphs  of Large Girth
+Normal rank
@@ Property / cites work @@
+A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
+Normal rank
@@ Property / cites work @@
+Closing complexity gaps for coloring problems on \(H\)-free graphs
+Normal rank
@@ Property / cites work @@
+\(H\)-colouring \(P_t\)-free graphs in subexponential time
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free graphs
+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 @@
+Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
+Normal rank
@@ Property / cites work @@
+Q4857375
@@ Property / cites work: Q4857375 / 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 @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263476
@@ Property / cites work: Q4263476 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of 4-coloring graphs without long induced paths
+Normal rank
@@ Property / cites work @@
+NP completeness of finding the chromatic index of regular graphs
+Normal rank
@@ Property / cites work @@
+Q4083461
@@ Property / cites work: Q4083461 / rank @@
+Normal rank
@@ Property / cites work @@
+Open Problems on Graph Coloring for Special Graph Classes
+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 @@
+Three-colourability and forbidden subgraphs. II: Polynomial algorithms
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Graph colorings with local constraints -- a survey
+Normal rank
@@ Property / cites work @@
+Q2770587
@@ Property / cites work: Q2770587 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://drops.dagstuhl.de/opus/volltexte/2018/9953/pdf/LIPIcs-ISAAC-2018-5.pdf
+Normal rank
@@ Property / OpenAlex ID @@
+W2962816679
@@ Property / OpenAlex ID: W2962816679 / rank @@
+Normal rank
@@ Property / title @@
+Colouring (P_r+P_s)-Free Graphs (English)
@@ Property / title: Colouring (P_r+P_s)-Free Graphs (English) / rank @@
+Normal rank