✦ LIBER ✦

On the Pagenumber of k -Trees

✍ Scribed by Vandenbussche, Jennifer; West, Douglas B.; Yu, Gexin

Book ID: 118197720
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 189 KB
Volume: 23
Category: Article
ISSN: 0895-4801
DOI: 10.1137/080714208

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The pagenumber of the class of bandwidth

The pagenumber of the class of bandwidth-k graphs is k − 1

✍ R.P Swaminathan; D Giriraj; D.K Bhatia 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 314 KB

On the Pagenumber of Complete Bipartite

On the Pagenumber of Complete Bipartite Graphs

✍ Hikoe Enomoto; Tomoki Nakamigawa; Katsuhiro Ota 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 324 KB

The pagenumber p(G) of a graph G is defined as the smallest n such that G can be embedded in a book with n pages. We give an upper bound for the pagenumber of the complete bipartite graph K m, n . Among other things, we prove p(K n, n ) w2nÂ3x+1 and p(K wn 2 Â4x, n ) n&1. We also give an asymptotic

On the Pagenumber of the Cube-Connected

On the Pagenumber of the Cube-Connected Cycles

✍ Yuuki Tanaka; Yukio Shibata 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 280 KB

On simple characterizations of k-trees

✍ Donald J. Rose 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 422 KB

k-trees are I special class of perfect elimination grap% which arise in the study of sparse linear systems. We present four simple ch,&r.xterizations of k-trees involving cliques, paths, and separators.

The spectral radius of trees on k pendan

The spectral radius of trees on k pendant vertices

✍ Baofeng Wu; Enli Xiao; Yuan Hong 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 221 KB

The pagenumber of toroidal graphs is at

The pagenumber of toroidal graphs is at most seven

✍ Toshiki Endo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 442 KB

In this paper, we show that seven pages are sufficient for a book embedding of any toroidal graph.