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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23, 11–24 (1989)
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)
Brandstädt, A., Lozin, V.V.: On the linear structure and clique-width of bipartite permutation graphs. Ars Combinatoria 67, 273–289 (2003)
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)
Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences 46, 218–270 (1993)
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)
Courcelle, B., Olariu, S.: Upper bounds to the clique-width of a graph. Discrete Applied Math. 101, 77–114 (2000)
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)
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)
Lozin, V.V., Rautenbach, D.: The tree- and clique-width of bipartite graphs in special classes. Australasian J. Combinatorics 34, 57–67 (2006)
Lozin, V.V., Rudolf, G.: Minimal Universal Bipartite Graphs. Ars Combinatoria 84, 345–356 (2007)
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)
Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Combinatorial Theory Ser. B 41, 92–114 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)