✦ LIBER ✦

Chain packing in graphs

✍ Scribed by Shigeru Masuyama; Toshihide Ibaraki

Book ID: 105301336
Publisher: Springer
Year: 1991
Tongue: English
Weight: 639 KB
Volume: 6
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01759074

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing Cycles in Graphs

✍ Guoli Ding; Wenan Zang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Packing bipartite graphs

✍ A. Pawel Wojda; Paul Vaderlind 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 383 KB

For two bipartite graphs G = (L, R; E) and G' = (L', R'; E') a bijection f: LwR --\* L'uR' such that f(L) = L' is called hi-placement when f(u)f(v)~E', for every edge uv ~ E (then G and G' are called hi-placeable). We give new sufficient conditions for bipartite graphs G and G' to be bi-placeable.

Packing paths in planar graphs

✍ András Frank 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 355 KB

Packing cycles in complete graphs

✍ Darryn Bryant; Daniel Horsley 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 242 KB

Packing cycles in graphs, II

✍ Guoli Ding; Zhenzhen Xu; Wenan Zang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 163 KB

Edge-Packing in Planar Graphs

✍ L. S. Heath; J. P. C. Vergara 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 396 KB