𝔖 Bobbio Scriptorium
✦   LIBER   ✦

\(L(1,1)\)-labelling of the direct product of a complete graph and a cycle

✍ Scribed by Kim, Byeong Moon; Rho, Yoomi; Song, Byung Chul

Book ID
121613435
Publisher
Springer US
Year
2013
Tongue
English
Weight
229 KB
Volume
30
Category
Article
ISSN
1382-6905

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

The direct power of a 1-graph
The direct power of a 1-graph
✍ Paul E. Blower Jr. πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 548 KB
A 1-factorization of the line graphs of
A 1-factorization of the line graphs of complete graphs
✍ Brian Alspach πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 254 KB πŸ‘ 1 views

## Abstract A 1‐factorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.