Skip to main content
SpringerLink
Log in

Maximum Clique Transversals

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2204))

Included in the following conference series:

Abstract

A maximum clique transversal set in a graph G is a set S of vertices such that every maximum clique of G contains at least a vertex in S. Clearly, removing a maximum clique transversal set reduces the clique number of a graph. We study algorithmic aspects of the problem, given a graph, to find a maximum clique transversal set of minimum cardinality. We consider the problem for planar graphs and present fixed parameter and approximation results.

We also examine some other graph classes: subclasses of chordal graphs such as k-trees, strongly chordal graphs, etc., graphs with few P 4s, comparability graphs, and distance hereditary graphs.

Most of this work was done while this author visited Chung Cheng University. During the initial part of the research for this project this author was supported by an Earmarked Research Grant from the Research Grants Council of Hong Kong.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alber, J., H. Bodlaender, H. Fernau, and R. Niedermeier, Fixed parameter algorithms for planar dominating set and related problems. Lecture Notes in Computer Science 1851, (2000), pp. 97–110. Proceedings SWAT’00.

    Google Scholar 

  2. Babel, L. and S. Olariu, On the structure of graphs with few P 4’s, Discrete Applied Mathematics 84, (1998), pp. 1–13.

    Article  MATH  MathSciNet  Google Scholar 

  3. Babel, L., T. Kloks, J. Kratochvíl, H. Müller, and S. Olariu, Algorithms for graphs with few P 4’s. To appear.

    Google Scholar 

  4. Baker, B. S., Approximation algorithms for NP-complete problems on planar graphs, Journal of the Association for Computing Machinery 41, (1994), pp. 153–180.

    MATH  MathSciNet  Google Scholar 

  5. Balachandran, V., P. Nagavamsi, and C. P. Rangan, Clique transversal and clique independence on comparability graphs, Information processing letters 58, (1996), pp. 181–184.

    Article  MathSciNet  Google Scholar 

  6. Brandstädt, A., V. B. Le, and J. P. Spinrad, Graph classes-A Survey, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.

    Google Scholar 

  7. Cai, Y. and M. C. Kong, Generating all maximal cliques and related problems for certain perfect graphs. Proceedings of the Twenty-third Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1992). Congr. Numer. 90 (1992), pp. 33–55.

    MathSciNet  Google Scholar 

  8. M.-S. Chang, Y.-H. Chen, G. J. Chang, and J. H. Yan, Algorithmic aspects of the generalised clique transversal problem on chordal graphs, Discrete Applied Mathematics 66, (1996), pp. 189–203.

    Article  MATH  MathSciNet  Google Scholar 

  9. M.-S. Chang, S.-Y. Hsieh, and G.-H. Chen, Dynamic programming on distance hereditary graphs. Lecture Notes in Computer Science 1350, (1997), pp 344–353.

    Google Scholar 

  10. Chrobak, M. and D. Eppstein, Planar orientations with low out-degree and Compaction of adjacency Matrices. Theoretical Computer Science 86, (1991), pp 243–266.

    Article  MATH  MathSciNet  Google Scholar 

  11. Corneil, D. G. and J. M. Keil, A dynamic programming approach to the domination set problem on k-trees, SIAM J. Algebraic and Discrete Methods 8, (1987), pp. 535–543.

    Article  MATH  MathSciNet  Google Scholar 

  12. Even, S., Graph Algorithms, Computer Science Press, Rockville, MD, 1979.

    MATH  Google Scholar 

  13. Garey, M. R., and D. S. Johnson, Computers and intractability—A guide to the theory of NP-completeness, W. H. Freeman and company, New York, 1999.

    Google Scholar 

  14. Guruswami, V. and C. P. Rangan, Algorithmic aspects of clique transversal and clique-independent sets, Discrete Applied Mathematics 100, (2000), pp. 183–202.

    Article  MATH  MathSciNet  Google Scholar 

  15. Itai, A. and M. Rodeh, Finding a minimum circuit in a graph, SIAM Journal on Computing 7, (1978), pp. 413–423.

    Article  MATH  MathSciNet  Google Scholar 

  16. Redei, L., Ein Konbinatorischer, Acta Litt. Szeged, 7, pp. 39–43, 1934.

    MATH  Google Scholar 

  17. Uehara, R., NP-complete problems on a 3-connected cubic planar graph and their applications, Technical Report TWCU-M-0004, Tokyo Woman’s Christian University, 1996 http://www.komazawa-u.ac.jp/~uehara/ps/triangle.ps.gz

  18. Papadimitriou, C. and M. Yannakakis, The clique problem for planar graphs, Information Processing Letters, 13, (1981), pp. 131–133.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, Chung Cheng University, Ming-Shiun, Chiayi 621, Taiwan

    Maw-Shang Chang & Chuan-Min Lee

  2. Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, TW20 OEX, UK

    Ton Kloks

Authors
  1. Maw-Shang Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ton Kloks
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chuan-Min Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Rostock, 18051, Rostock, Germany

    Andreas Brandstädt  & Van Bang Le  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, MS., Kloks, T., Lee, CM. (2001). Maximum Clique Transversals. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45477-2_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42707-0

  • Online ISBN: 978-3-540-45477-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation