𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition andl1-Embedding of Weakly Median Graphs

✍ Scribed by Hans-Jürgen Bandelt; Victor Chepoi

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
203 KB
Volume
21
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Even cycle decompositions of complete gr
Even cycle decompositions of complete graphs minus a 1-factor
✍ Brian Alspach; Susan Marshall 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 873 KB

Some sufficient conditions are proven for the complete graph of even order with a 1-factor removed to be decomposable into even length cycles. 0 1994 John Wiley & Sons, Inc. ## 1. Introduction It is natural to ask when a complete graph admits a decomposition into cycles of some fixed length. Since

Symmetric Hamilton cycle decompositions
Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
✍ Richard A. Brualdi; Michael W. Schroeder 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB 👁 1 views

Let n ≥ 2 be an integer. The complete graph K n with a 1-factor F removed has a decomposition into Hamilton cycles if and only if n is even. We show that K n -F has a decomposition into Hamilton cycles which are symmetric with respect to the 1-factor F if and only if n ≡ 2,4 mod 8. We also show that

Decomposition of the complete graph plus
Decomposition of the complete graph plus a 1-factor into cycles of equal length
✍ Mateja Šajna 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB 👁 1 views

## Abstract We determine the necessary and sufficient conditions for the existence of a decomposition of the complete graph of even order with a 1‐factor added into cycles of equal length. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 170–207, 2003; Published online in Wiley InterScience (www