Homogeneous factorisations of graph products
✍ Scribed by Michael Giudici; Cai Heng Li; Primož Potočnik; Cheryl E. Praeger
- Book ID
- 108113856
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 257 KB
- Volume
- 308
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cycle. Let n=p 2 for an odd prime p. We construct a family of ( p -1)/2 non-isomorphic perfect 1-factorisations of K n, n . Equivalently, we construct pan-Hamiltonian Latin squares of order n. A Latin s
The k-linear arboricity of a graph G is the minimum number of forests whose connected components are paths of length at most k which partition E(G). Motivated by this index, we investigate a variation of this idea for d-regular graphs. Namely, we define a d-regular graph G to be (l,k)-linear arborif