Title:
Graphs of Small Rank-Width are Pivot-Minors of Graphs of Small Tree-Width
Graphs of Small Rank-Width are Pivot-Minors of Graphs of Small Tree-Width
Files
Author(s)
Oum, Sang-il
Advisor(s)
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
We prove that every graph of rank-width k is a pivot-minor of a graph of tree-width at most 2k. We also prove that graphs of rank-width at most 1, also known as distance-hereditary graphs, are exactly vertex-minors of trees, and graphs of linear rank-width at most 1 are precisely vertex-minors of paths. This is a joint work with O-Joung Kwon.
Sponsor
NSF, NSA, ONR, IMA, Colleges of Sciences, Computing and Engineering
Date Issued
2012-05
Extent
Resource Type
Text
Resource Subtype
Proceedings