Linear Rank-Width and Linear Clique-Width of Trees
From MaRDI portal
Publication:2864286
DOI10.1007/978-3-642-45043-3_3zbMath1417.05041OpenAlexW2096112628MaRDI QIDQ2864286
Isolde Adler, Mamadou Moustapha Kanté
Publication date: 6 December 2013
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_3
Paths and cycles (05C38) Graph minors (05C83) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
A SAT Approach to Clique-Width, Clique-width with an inactive label, Neighbourhood-width of trees, Several notions of rank-width for countable graphs, Linear rank-width and linear clique-width of trees