Colouring graphs of bounded diameter in the absence of small cycles (Q5925681): Difference between revisions

@@ Property / cites work @@
+Q3142409
@@ Property / cites work: Q3142409 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of surjective homomorphism problems-a survey
+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 @@
+Q4589007
@@ Property / cites work: Q4589007 / rank @@
+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 @@
+Coloring graphs without short cycles and long induced paths
+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 @@
+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 @@
+Q4263476
@@ Property / cites work: Q4263476 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083461
@@ Property / cites work: Q4083461 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3558598
@@ Property / cites work: Q3558598 / 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 @@
+Colouring H-free graphs of bounded diameter.
@@ Property / cites work: Colouring H-free graphs of bounded diameter. / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and almost tight results for 3-colorability of small diameter graphs
+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 @@
+Graph colorings with local constraints -- a survey
+Normal rank