A Complete Characterisation of the Linear Clique-Width of Path Powers
From MaRDI portal
Publication:3630209
DOI10.1007/978-3-642-02017-9_27zbMath1241.05120OpenAlexW179520739MaRDI QIDQ3630209
Charis Papadopoulos, Daniel Meister, Pinar Heggernes
Publication date: 3 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_27
Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Clique-width of path powers, Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs, Linear Clique‐Width for Hereditary Classes of Cographs, Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width, Neighbourhood-width of trees, Comparing linear width parameters for directed graphs, Linear rank-width and linear clique-width of trees