Faster 3-coloring of small-diameter graphs

We study the 3-Coloring problem in graphs with small diameter. In 2013, Mertzios and Spirakis showed that for n-vertex diameter-2 graphs this problem can be solved in subexponential time 2^{𝒪(√{n log n})}. Whether the problem can be solved in polynomial time remains a well-known open question in the area of algorithmic graphs theory. In this paper we present an algorithm that solves 3-Coloring in n-vertex diameter-2 graphs in time 2^{𝒪(n^{1/3} log² n)}. This is the first improvement upon the algorithm of Mertzios and Spirakis in the general case, i.e., without putting any further restrictions on the instance graph. In addition to standard branchings and reducing the problem to an instance of 2-Sat, the crucial building block of our algorithm is a combinatorial observation about 3-colorable diameter-2 graphs, which is proven using a probabilistic argument. As a side result, we show that 3-Coloring can be solved in time 2^{𝒪((n log n)^{2/3})} in n-vertex diameter-3 graphs. We also generalize our algorithms to the problem of finding a list homomorphism from a small-diameter graph to a cycle.

[1]  Barnaby Martin,et al.  Colouring Graphs of Bounded Diameter in the Absence of Small Cycles , 2021, ArXiv.

[2]  Stefan Porschen.  On variable-weighted exact satisfiability problems , 2007, Annals of Mathematics and Artificial Intelligence.

[3]  Jian Song,et al.  A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs , 2014, J. Graph Theory.

[4]  J. Kratochvil,et al.  Intersection Graphs of Segments , 1994, J. Comb. Theory, Ser. B.

[5]  Ana Silva,et al.  Coloring Problems on Bipartite Graphs of Small Diameter , 2020, Electron. J. Comb..

[6]  A. M. Murray.  The strong perfect graph theorem , 2019, 100 Years of Math Milestones.

[7]  M. Habib.  Probabilistic methods for algorithmic discrete mathematics , 1998 .

[8]  Mark de Berg,et al.  A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs , 2020, SIAM J. Comput..

[9]  Daniël Paulusma,et al.  Clique-Width for Hereditary Graph Classes , 2019, BCC.

[10]  Paul G. Spirakis,et al.  Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs , 2012, SOFSEM.

[11]  Michal Pilipczuk,et al.  Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams , 2015, ESA.

[12]  Keith Edwards,et al.  The Complexity of Colouring Problems on Dense Graphs , 1986, Theor. Comput. Sci..

[13]  Marthe Bonamy,et al.  EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs , 2021, J. ACM.

[14]  Jan Kratochvíl.  Can they cross? and how?: (the hitchhiker's guide to the universe of geometric intersection graphs) , 2011, SoCG '11.

[15]  Marthe Bonamy,et al.  Independent Feedback Vertex Sets for Graphs of Bounded Diameter , 2017, Inf. Process. Lett..

[16]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .

[17]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[18]  Pavol Hell,et al.  List Homomorphisms and Circular Arc Graphs , 1999, Comb..

[19]  Daniel Lokshtanov,et al.  Independent Set on Pk-Free Graphs in Quasi-Polynomial Time , 2020, ArXiv.

[20]  P. Hell,et al.  Sparse pseudo-random graphs are Hamiltonian , 2003 .

[21]  G. Nemhauser,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2014 .

[22]  Sebastian Schnettler,et al.  A structured overview of 50 years of small-world research , 2009, Soc. Networks.

[23]  Daniël Paulusma,et al.  Colouring H-Free Graphs of Bounded Diameter , 2019, MFCS.

[24]  Marthe Bonamy,et al.  Independent Feedback Vertex Set for $P_5$-free Graphs , 2017, ISAAC.