Advertisement

Local Coloring: New Observations and New Reductions

  • Jie YouEmail author
  • Yixin Cao
  • Jianxin Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11458)

Abstract

A k-coloring of a graph is an assignment of integers between 1 and k to vertices in the graph such that the endpoints of each edge receive different numbers. We study a local variation of the coloring problem, which imposes further requirements on every set of three vertices: We are not allowed to use two consecutive numbers for a path on three vertices, or three consecutive numbers for a cycle on three vertices. Given a graph G and a positive integer k, the local coloring problem asks for whether G admits a local k-coloring. We show that it cannot be solved in subexponential time, unless the Exponential Time Hypothesis fails, and a new reduction for the NP-hardness of this problem. Our structural observations behind these reductions are of independent interests. We close the paper with a short remark on local colorings of perfect graphs.

References

  1. 1.
    Chartrand, G., Saba, F., Salehi, E., Zhang, P.: Local colorings of graphs. Utilitas Math. 67, 107–120 (2005)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Chartrand, G., Salehi, E., Zhang, P.: On local colorings of graphs. Congr. Numer. 163, 207–221 (2003)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Garey, M.R., Johnson, D.S., Sockeye, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237–267 (1976).  https://doi.org/10.1016/0304-3975(76)90059-1MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Li, Z., Zhu, E., Shao, Z., Jin, X.: NP-completeness of local colorings of graphs. Inf. Process. Lett. 130, 25–29 (2018).  https://doi.org/10.1016/j.ipl.2017.09.013MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Impagliazzo, R., Paturi, R.: On the complexity of \(k\)-SAT. J. Comput. Syst. Sci. 62(2), 367–375 (2001).  https://doi.org/10.1006/jcss.2000.1727MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Lovász, L.: Coverings and colorings of hypergraphs. In: Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 3–12 (1973)Google Scholar
  7. 7.
    Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, San Diego, California, pp. 216–226 (1978).  https://doi.org/10.1145/800133.804350
  8. 8.
    Shitov, Y.: On the complexity of graph coloring with additional local conditions. Inf. Process. Lett. 135, 92–94 (2018).  https://doi.org/10.1016/j.ipl.2018.03.009MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.School of Computer Science and EngineeringCentral South UniversityChangshaChina
  2. 2.Department of ComputingHong Kong Polytechnic UniversityKowloonHong Kong, China

Personalised recommendations