Polynomial cases for the vertex coloring problem (Q666663): Difference between revisions

@@ 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 @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+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 @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Four classes of perfectly orderable graphs
@@ Property / cites work: Four classes of perfectly orderable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bull-free Berge graphs are perfect
@@ Property / cites work: Bull-free Berge graphs are perfect / rank @@
+Normal rank
@@ Property / cites work @@
+Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
+Normal rank
@@ Property / cites work @@
+Q4954442
@@ Property / cites work: Q4954442 / rank @@
+Normal rank
@@ Property / cites work @@
+On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs
+Normal rank
@@ Property / cites work @@
+On the structure of bull-free perfect graphs
@@ Property / cites work: On the structure of bull-free perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Zero knowledge and the chromatic number
@@ Property / cites work: Zero knowledge and the chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
+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 @@
+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 @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / 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 @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs
+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 @@
+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 @@
+ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S
+Normal rank
@@ Property / cites work @@
+Modular decomposition and transitive orientation
@@ Property / cites work: Modular decomposition and transitive orientation / rank @@
+Normal rank
@@ Property / cites work @@
+MSOL partitioning problems on graphs of bounded treewidth and clique-width
+Normal rank
@@ Property / cites work @@
+Recognizing bull-free perfect graphs
@@ Property / cites work: Recognizing bull-free perfect graphs / rank @@
+Normal rank