✦ LIBER ✦

On the connectedness of some geometric graphs

✍ Scribed by Joseph Zaks

Book ID: 107884291
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 401 KB
Volume: 49
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90023-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-coloured complete graphs: Connected

Edge-coloured complete graphs: Connectedness of some subgraphs

✍ Adam Idzik; Jan Komar; Marcin Malawski 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 435 KB

If the edges of a complete graph K,., m/> 4, are painted two colours so that monochromatic K " graphs are connected, then there exists an increasing sequence ( n)n~4 of complete subgraphs whose monochromatic subgraphs are also connected. For more than two colours this is not true, but an analogous f

On the connectedness of optimum-degenera

On the connectedness of optimum-degeneracy graphs

✍ Peter Zörnig; Tomas Gal 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 516 KB

The K-Connectedness of Bipartite Graphs

✍ Wright, E. M. 📂 Article 📅 1982 🏛 Oxford University Press 🌐 English ⚖ 128 KB

The k-Connectedness of Unlabelled Graphs

✍ Walsh, T. R. S.; Wright, E. M. 📂 Article 📅 1978 🏛 Oxford University Press 🌐 English ⚖ 144 KB

Connectedness of certain random graphs

✍ L. A. Shepp 📂 Article 📅 1989 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 469 KB

On Some Variants of Connectedness

✍ M. Bognár 📂 Article 📅 1998 🏛 Akadmiai Kiad 🌐 English ⚖ 239 KB