Abstract
A k-path power is the k-power graph of a simple path of arbitrary length. Path powers form a non-trivial subclass of proper interval graphs. Their clique-width is not bounded by a constant, and no polynomial-time algorithm is known for computing their clique-width or linear clique-width. We show that k-path powers above a certain size have linear clique-width exactly k + 2, providing the first complete characterisation of the linear clique-width of a graph class of unbounded clique-width. Our characterisation results in a simple linear-time algorithm for computing the linear clique-width of all path powers.
This work is supported by the Research Council of Norway.
This is a preview of subscription content, log in via an institution to check access.
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
Boliac, R., Lozin, 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., Dragan, F., Le, H.-O., Mosca, R.: New Graph Classes of Bounded Clique-Width. Theory of Computing Systems 38, 623–645 (2005)
Brandstädt, A., Engelfriet, J., Le, H.-O., Lozin, V.: Clique-Width for 4-Vertex Forbidden Subgraphs. Theory of Computing Systems 39, 561–590 (2006)
Corneil, D.G., Habib, M., Lanlignel, J.-M., Reed, B.A., Rotics, U.: Polynomial time recognition of clique-width ≤ 3 graphs. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 126–134. Springer, Heidelberg (2000)
Corneil, D.G., Rotics, U.: On the Relationship between Clique-width and Treewidth. SIAM Journal on Computing 34, 825–847 (2005)
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 of Computing Systems 33, 125–150 (2000)
Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics 108, 23–52 (2001)
Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Applied Mathematics 101, 77–114 (2000)
Espelage, W., Gurski, F., Wanke, E.: Deciding clique-width for graphs of bounded tree-width. J. Graph Algorithms Appl. 7, 141–180 (2003)
Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width Minimization is NP-hard. In: STOC 2006, pp. 354–362 (2006)
Fomin, F., Golovach, P., Lokshtanov, D., Saurabh, S.: Clique-width: On the Price of Generality. In: SODA 2009, pp. 825–834 (2009)
Golumbic, M.C., Rotics, U.: On the Clique-Width of Some Perfect Graph Classes. International Journal of Foundations of Computer Science 11, 423–443 (2000)
Gurski, F.: Characterizations for co-graphs defined by restricted NLC-width or clique-width operations. Discrete Mathematics 306, 271–277 (2006)
Gurski, F.: Linear layouts measuring neighbourhoods in graphs. Discrete Mathematics 306, 1637–1650 (2006)
Gurski, F., Wanke, E.: On the relationship between NLC-width and linear NLC-width. Theoretical Computer Science 347, 76–89 (2005)
Gurski, F., Wanke, E.: The NLC-width and clique-width for powers of graphs of bounded tree-width. Discrete Applied Mathematics 157, 583–595 (2009)
Heggernes, P., Meister, D., Papadopoulos, C.: A new representation of proper interval graphs with an application to clique-width. Electronic Notes in Discrete Mathematics 32, 27–34 (2009)
Heggernes, P., Meister, D., Papadopoulos, C.: Graphs of small bounded linear clique-width. Tech. rep. 362 in Informatics, University of Bergen (2007)
Heggernes, P., Meister, D., Papadopoulos, C.: Graphs of Linear Clique-Width at Most 3. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 330–341. Springer, Heidelberg (2008)
Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics 126, 197–221 (2003)
Lozin, V.: From tree-width to clique-width: excluding a unit interval graph. In: ISAAC 2008. LNCS, vol. 5369, pp. 872–883. Springer, Heidelberg (2008)
Lozin, V., Rautenbach, D.: Chordal bipartite graphs of bounded tree- and clique-width. Discrete Mathematics 283, 151–158 (2004)
Lozin, V., Rautenbach, D.: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. SIAM Journal on Discrete Mathematics 18, 195–206 (2004)
Lozin, V., Rautenbach, D.: The relative clique-width of a graph. Journal of Combinatorial Theory, Series B 97, 846–858 (2007)
Makowsky, J.A., Rotics, U.: On the clique-width of graphs with few P 4s. International Journal of Foundations of Computer Science 10, 329–348 (1999)
Makowsky, J.A., Rotics, U., Averbouch, I., Godlin, B.: Computing Graph Polynomials on Graphs of Bounded Clique-Width. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 191–204. Springer, Heidelberg (2006)
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
Heggernes, P., Meister, D., Papadopoulos, C. (2009). A Complete Characterisation of the Linear Clique-Width of Path Powers. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-02017-9_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02016-2
Online ISBN: 978-3-642-02017-9
eBook Packages: Computer ScienceComputer Science (R0)