Q5092372 (Q5092372): Difference between revisions

@@ Property / cites work @@
+Q3142409
@@ Property / cites work: Q3142409 / rank @@
+Normal rank
@@ Property / cites work @@
+Three-coloring and list three-coloring of graphs without induced paths on seven vertices
+Normal rank
@@ Property / cites work @@
+Hard coloring problems in low degree planar bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q4589007
@@ Property / cites work: Q4589007 / rank @@
+Normal rank
@@ Property / cites work @@
+List 3-coloring graphs with no induced \(P_6 + rP_3\)
+Normal rank
@@ Property / cites work @@
+Four-coloring <i>P</i><sub>6</sub>-free graphs
@@ Property / cites work: Four-coloring <i>P</i><sub>6</sub>-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
+Normal rank
@@ Property / cites work @@
+Q5677530
@@ Property / cites work: Q5677530 / rank @@
+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 @@
+\(H\)-colouring \(P_t\)-free graphs in subexponential time
+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 @@
+On Moore Graphs with Diameters 2 and 3
@@ Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank @@
+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 @@
+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 @@
+Algorithms and almost tight results for 3-colorability of small diameter graphs
+Normal rank
@@ Property / cites work @@
+Colouring graphs when the number of colours is almost the maximum degree
+Normal rank
@@ Property / cites work @@
+Open Problems on Graph Coloring for Special Graph Classes
+Normal rank
@@ Property / cites work @@
+Vertex colouring and forbidden subgraphs -- a survey
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+There is No Irregular Moore Graph
@@ Property / cites work: There is No Irregular Moore Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph colorings with local constraints -- a survey
+Normal rank