Bipartite Graphs of Large Clique-Width

Korpelainen, Nicholas and Lozin, Vadim V. (2009). Bipartite Graphs of Large Clique-Width. In: Combinatorial Algorithms, Springer-Verlag, pp. 385–395.

URL: http://dx.doi.org/10.1007/978-3-642-10217-2_38

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.

Viewing alternatives

Look up in Google Scholar
No digital document available to download for this item

Item Actions

Export

About

CORE (COnnecting REpositories)