4‐Coloring P 6 ‐Free Graphs with No Induced 5‐Cycles (Q2978175): Difference between revisions

@@ Property / arXiv ID @@
+.2487
@@ Property / arXiv ID: 1407.2487 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+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 @@
+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 @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of colouring problems on dense graphs
+Normal rank
@@ Property / cites work @@
+Coloring graphs without short cycles and long induced paths
+Normal rank
@@ Property / cites work @@
+Complexity of Coloring Graphs without Paths and Cycles
+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 @@
+Q4838453
@@ Property / cites work: Q4838453 / 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 @@
+-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 @@
+Decomposition by clique separators
@@ Property / cites work: Decomposition by clique separators / rank @@
+Normal rank
@@ Property / cites work @@
+Q2770587
@@ Property / cites work: Q2770587 / rank @@
+Normal rank

4‐Coloring <i>P</i> <sub>6</sub> ‐Free Graphs with No Induced 5‐Cycles (Q2978175): Difference between revisions

Latest revision as of 17:55, 13 July 2024

Statements

Sitelinks

Mathematics(1 entry)