Linear rank-width and linear clique-width of trees
DOI10.1007/978-3-642-45043-3_3zbMATH Open1417.05041OpenAlexW2096112628MaRDI QIDQ2864286FDOQ2864286
Authors: 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
Recommendations
- Linear rank-width and linear clique-width of trees
- Excluded vertex-minors for graphs of linear rank-width at most \(k\).
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
- Tree pivot-minors and linear rank-width
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Paths and cycles (05C38) Graph minors (05C83)
Cited In (15)
- Tree pivot-minors and linear rank-width
- Approximating rank-width and clique-width quickly
- Excluded vertex-minors for graphs of linear rank-width at most \(k\).
- Linear rank-width and linear clique-width of trees
- Clique-width with an inactive label
- Tree pivot-minors and linear rank-width
- A Linear Algorithm for Topological Bandwidth in Degree-Three Trees
- Vertex-minors of graphs: a survey
- A Complete Characterisation of the Linear Clique-Width of Path Powers
- Neighbourhood-width of trees
- Tree-width, clique-minors, and eigenvalues.
- Several notions of rank-width for countable graphs
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
- Obstructions for linear rank-width at most 1
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
This page was built for publication: Linear rank-width and linear clique-width of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864286)
