Abstract
We prove that in the class of bi-complement reducible graphs linear clique-width is unbounded and show that this class contains exactly two minimal hereditary subclasses of unbounded linear clique-width.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Adler, I., Kanté, M.M.: Linear rank-width and linear clique-width of trees. Theoret. Comput. Sci. 589, 87–98 (2015)
Brandstädt, A., Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding the clique-width of \(H\)-free split graphs. Discrete Appl. Math. 211, 30–39 (2016)
Brignall, R., Korpelainen, N., Vatter, V.: Linear clique-width for hereditary classes of cographs. J. Graph Theory 84, 501–511 (2017)
Collins, A., Foniok, J., Korpelainen, N., Lozin, V., Zamaraev, V.: Infinitely many minimal classes of graphs of unbounded clique-width. Discrete Appl. Math. (accepted). https://doi.org/10.1016/j.dam.2017.02.012
Dabrowski, K.K., Huang, S., Paulusma, D.: Classifying the clique-width of \(H\)-free bipartite graphs. Discrete Appl. Math. 200, 43–51 (2016)
Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width is NP-complete. SIAM J. Discrete Math. 23(2), 909–939 (2009)
Giakoumakis, V., Vanherpe, J.: Bi-complement reducible graphs. Adv. Appl. Math. 18, 389–402 (1997)
Golumbic, M.C.: Trivially perfect graphs. Discrete Math. 24, 105–107 (1978)
Gurski, F., Wanke, E.: On the relationship between NCL-width and linear NCL-width. Theoret. Comput. Sci. 347, 76–89 (2005)
Heggernes, P., Meister, D., Papadopoulos, C.: Graphs of linear clique-width at most 3. Theoret. Comput. Sci. 412, 5466–5486 (2011)
Heggernes, P., Meister, D., Papadopoulos, C.: Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Discrete Appl. Math. 160, 888–901 (2012)
Lozin, V.: Minimal classes of graphs of unbounded clique-width. Ann. Comb. 15, 707–722 (2011)
Lozin, V., Rautenbach, D.: Chordal bipartite graphs of bounded tree- and clique-width. Discrete Math. 283, 151–158 (2004)
Lozin, V.V., Volz, J.: The clique-width of bipartite graphs in monogenic classes. Int. J. Found. Comput. Sci. 19, 477–494 (2008)
Yan, J.-H., Chen, J.-J., Chang, G.J.: Quasi-threshold graphs. Discrete Appl. Math. 69, 247–255 (1996)
Acknowledgment
Viktor Zamaraev acknowledges support from EPSRC, grant EP/P020372/1.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Alecu, B., Lozin, V., Zamaraev, V. (2018). Linear Clique-Width of Bi-complement Reducible Graphs. In: Iliopoulos, C., Leong, H., Sung, WK. (eds) Combinatorial Algorithms. IWOCA 2018. Lecture Notes in Computer Science(), vol 10979. Springer, Cham. https://doi.org/10.1007/978-3-319-94667-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-94667-2_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94666-5
Online ISBN: 978-3-319-94667-2
eBook Packages: Computer ScienceComputer Science (R0)