Tree pivot-minors and linear rank-width

MaRDI QIDQ6621185FDO

Authors Konrad Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-Il Oum, Daniël Paulusma

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Graph minors (05C83)

Recommendations

• Tree pivot-minors and linear rank-width
• Graphs of small rank-width are pivot-minors of graphs of small tree-width
• Linear rank-width and linear clique-width of trees
• Linear rank-width and linear clique-width of trees
• Rank-width and tree-width of \(H\)-minor-free graphs

Cites work

• scientific article; zbMATH DE number 1534645 (Why is no real title available?)
• Approximating clique-width and branch-width
• Circle graph obstructions
• Circle graph obstructions under pivoting
• Clique-width and edge contraction
• Colouring diamond-free graphs
• Computing small pivot-minors
• Decomposition of Directed Graphs
• Excluding a bipartite circle graph from line graphs
• Graph minors. I. Excluding a forest
• Graphs of small rank-width are pivot-minors of graphs of small tree-width
• Linear rank-width and linear clique-width of trees
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
• Matroid Pathwidth and Code Trellis Complexity
• Obstructions for linear rank-width at most 1
• Rank-Width and Well-Quasi-Ordering
• Rank-width and vertex-minors
• Rank-width: algorithmic and structural results
• The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
• Thread graphs, linear rank-width and their algorithmic applications
• Transforming trees by successive local complementations
• Upper bounds to the clique width of graphs

This page was built for publication: Tree pivot-minors and linear rank-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621185)