✦ LIBER ✦

Rankings of Graphs

✍ Scribed by Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Dieter; Müller, Haiko; Tuza, Zsolt

Book ID: 118197253
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 305 KB
Volume: 11
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480195282550

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rankings of Directed Graphs

✍ Kratochvíl, Jan; Tuza, Zsolt 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 286 KB

Rank-perfect and" weakly rank-perfect gr

Rank-perfect and" weakly rank-perfect graphs

✍ Annegret K. Wagler 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 325 KB

Minimum rank of outerplanar graphs

✍ John Sinkovic; Mark Kempton 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 435 KB

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

Rank numbers of grid graphs

✍ Hannah Alpert 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 295 KB

Almost rank three graphs

✍ A. Gardiner 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 314 KB

## Gardiner, A., Almost rank three graphs, Discrete Mathematics 103 (1992) 253-257.