Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width

  • Martin Doucha
  • Jan Kratochvíl
Conference paper

DOI: 10.1007/978-3-642-32589-2_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7464)
Cite this paper as:
Doucha M., Kratochvíl J. (2012) Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width. In: Rovan B., Sassone V., Widmayer P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg

Abstract

The cluster vertex deletion number of a graph is the minimum number of its vertices whose deletion results in a disjoint union of complete graphs. This generalizes the vertex cover number, provides an upper bound to the clique-width and is related to the previously studied notion of the twin cover of the graph under consideration. We study the fixed parameter tractability of basic graph theoretic problems related to coloring and Hamiltonicity parameterized by cluster vertex deletion number. Our results show that most of these problems remain fixed parameter tractable as well, and thus we push the borderline between tractability and intractability towards the clique-width parameter.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Martin Doucha
    • 1
  • Jan Kratochvíl
    • 1
  1. 1.Department of Applied Mathematics, Faculty of Mathematics and PhysicsCharles UniversityPragueCzech Republic

Personalised recommendations