𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by R.P Swaminathan; D Giriraj; D.K Bhatia

Book ID
111708621
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
314 KB
Volume
55
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Pagenumber of k -Trees
On the Pagenumber of k -Trees
✍ Vandenbussche, Jennifer; West, Douglas B.; Yu, Gexin 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 189 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.

The existence of k-to-1 continuous maps
The existence of k-to-1 continuous maps between graphs when k is sufficiently large
✍ A. J. W. Hilton 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 867 KB

## Abstract Jo Heath and the author found a set of necessary and sufficient conditions for the existence of an exactly __k__‐to‐1 map from a graph __G__ to a graph __H.__ These conditions were all local ones. Here this result is used to give necessary and sufficient conditions for the existence of

The bandwidth of a tree with k leaves is
The bandwidth of a tree with k leaves is at most [k2]
✍ Kiyoshi Ando; Atsusi Kaneko; Severino Gervacio 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 171 KB

The bandwidth B(G) of a finite simple graph G is the minimum of the quantity max{ If(x)-f(Y)I:xyC E(G)} taken over all injective integer labellings f of G. We prove that if a tree T has k leaves then B(T)<~ [k/2~. This improves the previously known upper bound B(T)<.IV(T)I/2

On the k-diameter of k-regular k-connect
On the k-diameter of k-regular k-connected graphs
✍ D. Frank Hsu; Tomasz Łuczak 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 391 KB

We study the k-diameter of k-regular k-connected graphs. Among other results, we show that every k-regular k-connected graph on n vertices has k-diameter at most n/2 and this upper bound cannot be improved when n = 4k -6 + i(2k -4). In particular, the maximal 3-diameter of 3-regular graphs with 2n v