Tree pivot-minors and linear rank-width
From MaRDI portal
Publication:6621185
Daniel Paulusma, Mamadou Moustapha Kanté, Jisu Jeong, Sang-il Oum, Konrad K. Dabrowski, O-joung Kwon, François Dross
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
- Graph minors. I. Excluding a forest
- Circle graph obstructions
- Computing small pivot-minors
- Upper bounds to the clique width of graphs
- Linear rank-width and linear clique-width of trees
- Clique-width and edge contraction
- Colouring diamond-free graphs
- Rank-width: algorithmic and structural results
- Obstructions for linear rank-width at most 1
- Graphs of small rank-width are pivot-minors of graphs of small tree-width
- Approximating clique-width and branch-width
- Rank-width and vertex-minors
- Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
- Excluding a bipartite circle graph from line graphs
- Matroid Pathwidth and Code Trellis Complexity
- Rank-Width and Well-Quasi-Ordering
- Circle graph obstructions under pivoting
- Transforming trees by successive local complementations
- Decomposition of Directed Graphs
- The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
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)
