Obstructions for linear rank-width at most 1

Authors:
Isolde Adler;Arthur M. Farley;Andrzej Proskurowski
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 12
Cited 0

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
Circle graph obstructions

Journal of Combinatorial Theory Series B
Obstruction set isolation for the gate matrix layout problem

Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Upper bounds to the clique width of graphs

Discrete Applied Mathematics
Edge dominating set and colorings on graphs with fixed clique-width

Discrete Applied Mathematics
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Rank-width and vertex-minors

Journal of Combinatorial Theory Series B
Approximating clique-width and branch-width

Journal of Combinatorial Theory Series B
Rank-Width and Well-Quasi-Ordering

SIAM Journal on Discrete Mathematics
Better Polynomial Algorithms on Graphs of Bounded Rank-Width

Combinatorial Algorithms
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms

Quantified Score

Hi-index	0.04

Visualization

Abstract

We establish the set of minimal forbidden induced subgraphs for the class of graphs having linear rank-width at most 1. From these we derive both the vertex-minor and pivot-minor obstructions for the class.