Advertisement

H-Free Coloring on Graphs with Bounded Tree-Width

  • N. R. Aravind
  • Subrahmanyam Kalyanasundaram
  • Anjeneya Swami KareEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11394)

Abstract

Let H be a fixed undirected graph. A vertex coloring of an undirected input graph G is said to be an \(H\)-Free Coloring if none of the color classes contain H as an induced subgraph. The \(H\)-Free Chromatic Number of G is the minimum number of colors required for an \(H\)-Free Coloring of G. This problem is NP-complete and is expressible in monadic second order logic (MSOL). The MSOL formulation, together with Courcelle’s theorem implies linear time solvability on graphs with bounded tree-width. This approach yields an algorithm with running time \(f(||\varphi ||, t)\cdot n\), where \(||\varphi ||\) is the length of the MSOL formula, t is the tree-width of the graph and n is the number of vertices of the graph. The dependency of \(f(||\varphi ||, t)\) on \(||\varphi ||\) can be as bad as a tower of exponentials.

In this paper, we provide an explicit combinatorial FPT algorithm to compute the \(H\)-Free Chromatic Number of a given graph G, parameterized by the tree-width of G. The techniques are also used to provide an FPT algorithm when H is forbidden as a subgraph (not necessarily induced) in the color classes of G.

References

  1. 1.
    Achlioptas, D.: The complexity of G-free colourability. Discret. Math. 165–166(Supplement C), 21–30 (1997)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Kubicka, E., Kubicki, G., McKeon, K.A.: Chromatic sums for colorings avoiding monochromatic subgraphs. Electron. Notes Discret. Math. 43, 247–254 (2013)CrossRefGoogle Scholar
  3. 3.
    Kubicka, E., Kubicki, G., McKeon, K.A.: Chromatic sums for colorings avoiding monochromatic subgraphs. Discuss. Math. Graph Theory 43, 541–555 (2015)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Karpiński, M.: Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete. Theor. Comput. Sci. 659(Supplement C), 88–94 (2017)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Xiao, M., Nagamochi, H.: Complexity and kernels for bipartition into degree-bounded induced graphs. Theor. Comput. Sci. 659, 72–82 (2017)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Cowen, L.J., Cowen, R.H., Woodall, D.R.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10(2), 187–195 (1986)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Bazgan, C., Tuza, Z., Vanderpooten, D.: Degree-constrained decompositions of graphs: bounded treewidth and planarity. Theor. Comput. Sci. 355(3), 389–395 (2006)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Wu, Y., Yuan, J., Zhao, Y.: Partition a graph into two induced forests. J. Math. Study 1, 1–6 (1996)MathSciNetzbMATHGoogle Scholar
  9. 9.
    Farrugia, A.: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. Electron. J. Comb. 11, 46 (2004)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Rao, M.: MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theor. Comput. Sci. 377(1), 260–267 (2007)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Courcelle, B.: The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. Theor. Inform. Appl. 26, 257–286 (1992)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Diestel, R.: Graph Theory. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  14. 14.
    Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015).  https://doi.org/10.1007/978-3-319-21275-3CrossRefzbMATHGoogle Scholar
  15. 15.
    Robertson, N., Seymour, P.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory Ser. B 52(2), 153–190 (1991)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Kloks, T. (ed.): Treewidth: Computations and Approximations. LNCS. Springer, Heidelberg (1994).  https://doi.org/10.1007/BFb0045375CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • N. R. Aravind
    • 1
  • Subrahmanyam Kalyanasundaram
    • 1
  • Anjeneya Swami Kare
    • 2
    Email author
  1. 1.Department of Computer Science and EngineeringIIT HyderabadHyderabadIndia
  2. 2.School of Computer and Information SciencesUniversity of HyderabadHyderabadIndia

Personalised recommendations