Linear rank-width and linear clique-width of trees

DOI10.1007/978-3-642-45043-3_3MaRDI QIDQ2864286zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

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)

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\)

Cited in

(15)

• Clique-width with an inactive label
• Tree pivot-minors and linear rank-width
• Obstructions for linear rank-width at most 1
• Vertex-minors of graphs: a survey
• A Complete Characterisation of the Linear Clique-Width of Path Powers
• Tree-width, clique-minors, and eigenvalues.
• Approximating rank-width and clique-width quickly
• Excluded vertex-minors for graphs of linear rank-width at most \(k\)
• A Linear Algorithm for Topological Bandwidth in Degree-Three Trees
• Linear rank-width and linear clique-width of trees
• Tree pivot-minors and linear rank-width
• Neighbourhood-width of trees
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
• Several notions of rank-width for countable graphs
• Excluded vertex-minors for graphs of linear rank-width at most \(k\).

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)