𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs of small rank-width are pivot-minors of graphs of small tree-width

✍ Scribed by Kwon, O-joung; Oum, Sang-il

Book ID
123263932
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
574 KB
Volume
168
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Ka,k Minors in Graphs of Bounded Tree-Wi
Ka,k Minors in Graphs of Bounded Tree-Width
✍ Thomas BΓΆhme; John Maharry; Bojan Mohar πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 175 KB

It is shown that for any positive integers k and w there exists a constant N ¼ N ðk; wÞ such that every 7-connected graph of tree-width less than w and of order at least N contains K 3;k as a minor. Similar result is proved for K a;k minors where a is an arbitrary fixed integer and the required conn

Characterizing graphs of small carving-w
Characterizing graphs of small carving-width
✍ Belmonte, RΓ©my; van ’t Hof, Pim; KamiΕ„ski, Marcin; Paulusma, DaniΓ«l; Thilikos, D πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 413 KB
Rank-width of random graphs
Rank-width of random graphs
✍ Choongbum Lee; Joonkyung Lee; Sang-il Oum πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 109 KB

Rank-width of a graph G, denoted by rw(G), is a width parameter of graphs introduced by Oum and Seymour [J Combin Theory Ser B 96 (2006), 514-528]. We investigate the asymptotic behavior of rank-width of a random graph G(n, p). We show that, asymptotically almost surely, (i 2 ), then rw(G(n, p)) =

Partitioning Graphs of Bounded Tree-Widt
Partitioning Graphs of Bounded Tree-Width
✍ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan πŸ“‚ Article πŸ“… 1998 πŸ› Springer-Verlag 🌐 English βš– 199 KB