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
| dc.contributor.author | Oum, Sang-il | |
| dc.date.accessioned | 2012-07-07T16:20:50Z | |
| dc.date.available | 2012-07-07T16:20:50Z | |
| dc.date.issued | 2012-05 | |
| dc.description | Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, May 7-11, 2012 in the Clough Undergraduate Learning Commons. | en_US |
| dc.description.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. | en_US |
| dc.description.sponsorship | NSF, NSA, ONR, IMA, Colleges of Sciences, Computing and Engineering | en_US |
| dc.identifier.uri | http://hdl.handle.net/1853/44217 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Georgia Institute of Technology | en_US |
| dc.subject | pivot-minor, tree-width | en_US |
| dc.title | Graphs of Small Rank-Width are Pivot-Minors of Graphs of Small Tree-Width | en_US |
| dc.type | Text | |
| dc.type.genre | Proceedings | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | College of Sciences | |
| local.contributor.corporatename | School of Mathematics | |
| local.relation.ispartofseries | Graph Theory @ Georgia Tech | |
| relation.isOrgUnitOfPublication | 85042be6-2d68-4e07-b384-e1f908fae48a | |
| relation.isOrgUnitOfPublication | 84e5d930-8c17-4e24-96cc-63f5ab63da69 | |
| relation.isSeriesOfPublication | b4422082-53fd-4ec1-a662-cefcfd38ab03 |