Tree Pivot-Minors and Linear Rank-Width
From MaRDI portal
Publication:5020842
DOI10.1137/21M1402339zbMath1480.05119arXiv2008.00561MaRDI QIDQ5020842
François Dross, O-joung Kwon, Sang-il Oum, Jisu Jeong, Daniël Paulusma, Konrad K. Dabrowski, Mamadou Moustapha Kanté
Publication date: 7 January 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.00561
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
- Graph minors. XX: Wagner's conjecture
- MSOL partitioning problems on graphs of bounded treewidth and clique-width
- Classifying the clique-width of \(H\)-free bipartite graphs
- Graph minors. I. Excluding a forest
- Graph minors. V. Excluding a planar graph
- Quickly excluding a forest
- Circle graph obstructions
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Computing small pivot-minors
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Bipartite graphs without a skew star
- Edge dominating set and colorings on graphs with fixed clique-width
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Obstructions for bounded shrub-depth and rank-depth
- The grid theorem for vertex-minors
- Between clique-width and linear clique-width of bipartite graphs
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- 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
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
- Steiner trees for hereditary graph classes: a treewidth perspective
- Linear Clique‐Width for Hereditary Classes of Cographs
- Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
- THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES
- Excluding a bipartite circle graph from line graphs
- Matroid Pathwidth and Code Trellis Complexity
- The Complexity of the Partial Order Dimension Problem
- Transforming trees by successive local complementations
- A Combinatorial Decomposition Theory
- The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
- Clique-width for hereditary graph classes
- Letter graphs and geometric grid classes of permutations: characterization and recognition
- Bounding the mim‐width of hereditary graph classes
This page was built for publication: Tree Pivot-Minors and Linear Rank-Width
