Faster 3-Coloring of Small-Diameter Graphs (Q5866453): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.13860
@@ Property / arXiv ID: 2104.13860 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3503433
@@ Property / cites work: Q3503433 / rank @@
+Normal rank
@@ Property / cites work @@
+EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
+Normal rank
@@ Property / cites work @@
+Independent feedback vertex sets for graphs of bounded diameter
+Normal rank
@@ Property / cites work @@
+Independent feedback vertex set for \(P_5\)-free graphs
+Normal rank
@@ Property / cites work @@
+Acyclic, star, and injective colouring: bounding the diameter
+Normal rank
@@ Property / cites work @@
+Partitioning \(H\)-free graphs of bounded diameter
+Normal rank
@@ Property / cites work @@
+Coloring problems on bipartite graphs of small diameter
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The three-in-a-tree problem
@@ Property / cites work: The three-in-a-tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width for hereditary graph classes
@@ Property / cites work: Clique-width for hereditary graph classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q6075926
@@ Property / cites work: Q6075926 / rank @@
+Normal rank
@@ Property / cites work @@
+A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
+Normal rank
@@ Property / cites work @@
+The complexity of colouring problems on dense graphs
+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 @@
+Can they cross? and how?
@@ Property / cites work: Can they cross? and how? / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection graphs of segments
@@ Property / cites work: Intersection graphs of segments / 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 @@
+Colouring graphs of bounded diameter in the absence of small cycles
+Normal rank
@@ Property / cites work @@
+Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
+Normal rank
@@ Property / cites work @@
+Q4226453
@@ Property / cites work: Q4226453 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and almost tight results for 3-colorability of small diameter graphs
+Normal rank
@@ Property / cites work @@
+Q5517743
@@ Property / cites work: Q5517743 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+On variable-weighted exact satisfiability problems
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5866453