✦ LIBER ✦

Properties of Regular Uniform k—Stratified Graphs

✍ Scribed by Konstantinos Kokkinos; Dionysios Kountanis

Book ID: 104444173
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 678 KB
Volume: 11
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00114-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast uniform generation of regular graph

Fast uniform generation of regular graphs

✍ Mark Jerrum; Alistair Sinclair 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 896 KB

Uniform generation of random regular gra

Uniform generation of random regular graphs of moderate degree

✍ Brendan D McKay; Nicholas C Wormald 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 795 KB

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

Regularity properties of H-graphs

✍ Finn, R.; Lu, J. 📂 Article 📅 1998 🏛 European Mathematical Society 🌐 English ⚖ 386 KB

k-factors in regular graphs

✍ Wai Chee Shiu; Gui Zhen Liu 📂 Article 📅 2008 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 171 KB

On some properties of 4-regular plane gr

On some properties of 4-regular plane graphs

✍ Mirko Horňá; Stanislav Jendroľ 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 542 KB

## Abstract The __d__‐distance face chromatic number of a connected plane graph is the minimum number of colors in such a coloring of its faces that whenever two distinct faces are at the distance at most __d__, they receive distinct colors. We estimate 1‐distance chromatic number for connected 4‐r