𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph operations characterizing rank-width

✍ Scribed by Bruno Courcelle; Mamadou Moustapha Kanté

Book ID
108112787
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
823 KB
Volume
157
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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)) =

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