Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph-Theoretic Concepts in Computer Science

WG 1996: Graph-Theoretic Concepts in Computer Science pp 67–72Cite as

Clique and anticlique partitions of graphs

  • Conference paper
  • First Online:

  • 230 Accesses

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

Abstract

In the paper we prove that, for a fixed k, the problem of deciding whether a graph admits a partition of its vertex set into k-element cliques or anticliques (i.e. independent sets) is polynomial.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon: A note on the decomposition of graphs into isomorphic matchings, Acta Math. Acad. Sci. Hung. 42 (1983), 221–223.

    Google Scholar 

  2. E. Cohen, M. Tarsi: NP-completeness of graph decomposition problem, Journal of Complexity 7 (1991), 200–212.

    Google Scholar 

  3. M.R. Garey, D.S. Johnson, Computers and Intractability. A guide to the Theory of NP-Completeness, Freeman, San Francisco 1979.

    Google Scholar 

  4. O. Favaron, Z. Lonc, M. Truszczyński: Decomposition of graphs into graphs with three edges, Ars Combinatoria 20 (1985), 125–146.

    Google Scholar 

  5. Z. Lonc, Delta-system decompositions of graphs, to appear in Discrete Applied Mathematics.

    Google Scholar 

  6. Z. Lonc, On complexity of some chain and antichain partition problem, in Graph-Theoretic Concepts in Computer Science (ed. G. Schmidt and R. Berghammer), Lecture Notes in Computer Science 570, Springer-Verlag 1992, 97–104.

    Google Scholar 

  7. Z. Lonc and M. Truszczyński, Decomposition of large uniform hypergraphs, Order 1 (1985) 345–350.

    Google Scholar 

  8. R.H. Möhring, Problem 9.10, in Graphs and Order (ed. I. Rival), Reidel Publishing Co., Dordrecht 1985, 583.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Warsaw University of Technology, Pl. Politechniki 1, 00-661, Warsaw, Poland

    Krzysztof Bryś & Zbigniew Lonc

Authors
  1. Krzysztof Bryś
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zbigniew Lonc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Fabrizio d'Amore Paolo Giulio Franciosa Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bryś, K., Lonc, Z. (1997). Clique and anticlique partitions of graphs. In: d'Amore, F., Franciosa, P.G., Marchetti-Spaccamela, A. (eds) Graph-Theoretic Concepts in Computer Science. WG 1996. Lecture Notes in Computer Science, vol 1197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62559-3_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-62559-3_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62559-9

  • Online ISBN: 978-3-540-68072-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation