Skip to main content
SpringerLink
Log in

Bipartite Graphs of Large Clique-Width

  • Conference paper
Combinatorial Algorithms (IWOCA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5874))

Included in the following conference series:

Abstract

Recently, several constructions of bipartite graphs of large clique-width have been discovered in the literature. In the present paper, we propose a general framework for developing such constructions and use it to obtain new results on this topic.

Research supported by the Centre for Discrete Mathematics and Its Applications (DIMAP), University of Warwick.

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. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23, 11–24 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Boliac, R., Lozin, V.V.: On the clique-width of graphs in hereditary classes. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 44–54. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Brandstädt, A., Lozin, V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Combinatoria 67, 273–289 (2003)

    MATH  MathSciNet  Google Scholar 

  4. Brandstädt, A., Engelfriet, J., Le, H.-O., Lozin, V.V.: Clique-Width for Four-Vertex Forbidden Subgraphs. Theory of Computing Systems 34, 561–590 (2006)

    Article  Google Scholar 

  5. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences 46, 218–270 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33, 125–150 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Courcelle, B., Olariu, S.: Upper bounds to the clique-width of a graph. Discrete Applied Math. 101, 77–114 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lozin, V.V.: From tree-width to clique-width: Excluding a unit interval graph. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 871–882. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Lozin, V.V., Rautenbach, D.: On the band-, tree- and clique-width of graphs with bounded vertex degree. SIAM J. Discrete Mathematics 18, 195–206 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lozin, V.V., Rautenbach, D.: The tree- and clique-width of bipartite graphs in special classes. Australasian J. Combinatorics 34, 57–67 (2006)

    MATH  MathSciNet  Google Scholar 

  11. Lozin, V.V., Rudolf, G.: Minimal Universal Bipartite Graphs. Ars Combinatoria 84, 345–356 (2007)

    MathSciNet  Google Scholar 

  12. Lozin, V.V., Volz, J.: The clique-width of bipartite graphs in monogenic classes. International Journal of Foundations of Computer Science 19, 477–494 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  13. Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Combinatorial Theory Ser. B 41, 92–114 (1986)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIMAP and Mathematics Institute, University of Warwick, Coventry, CV4 7AL, UK

    Nicholas Korpelainen & Vadim V. Lozin

Authors
  1. Nicholas Korpelainen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vadim V. Lozin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. School of Electrical Engineering and Computer Science, The University of Newcastle, University Drive, NSW 2308, Callaghan, Australia

    Mirka Miller

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korpelainen, N., Lozin, V.V. (2009). Bipartite Graphs of Large Clique-Width. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10217-2_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10216-5

  • Online ISBN: 978-3-642-10217-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation