On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2787859587
@@ Property / OpenAlex ID: W2787859587 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02447
@@ Property / arXiv ID: 1712.02447 / rank @@
+Normal rank
@@ Property / cites work @@
+On algorithms for (\(P_5\), gem)-free graphs
@@ Property / cites work: On algorithms for (\(P_5\), gem)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal co-gem-free and (\(P_{5}\),\,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 @@
+Solving the clique cover problem on (bull, \(C_4\))-free graphs
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring diamond-free graphs
@@ Property / cites work: Colouring diamond-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring of graphs with Ramsey-type forbidden subgraphs
+Normal rank
@@ Property / cites work @@
+Uniquely Colourable Graphs and  the Hardness of Colouring Graphs  of Large Girth
+Normal rank
@@ Property / cites work @@
+Colouring square-free graphs without long induced paths.
+Normal rank
@@ Property / cites work @@
+Choosability of P 5-Free Graphs
@@ Property / cites work: Choosability of P 5-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
+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 @@
+Q3216686
@@ Property / cites work: Q3216686 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of coloring graphs without paths and cycles
+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 @@
+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 @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083461
@@ Property / cites work: Q4083461 / 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 @@
+Coloring vertices of claw-free graphs in three colors
+Normal rank
@@ Property / cites work @@
+On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
+Normal rank
@@ Property / cites work @@
+The coloring problem for classes with two small obstructions
+Normal rank
@@ Property / cites work @@
+Two cases of polynomial-time solvability for the coloring problem
+Normal rank
@@ Property / cites work @@
+Two complexity results for the vertex coloring problem
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Some new hereditary classes where graph coloring remains NP-hard
+Normal rank