Graph decompositions in projective geometries
M Buratti, A Nakić… - Journal of Combinatorial …, 2021 - Wiley Online Library
Let PG (F qv) be the (v− 1)‐dimensional projective space over F q and let Γ be a simple
graph of order qk− 1 q− 1 for some k. A 2−(v, Γ, λ) design over F q is a collection ℬ of graphs …
graph of order qk− 1 q− 1 for some k. A 2−(v, Γ, λ) design over F q is a collection ℬ of graphs …
The Oberwolfach problem with loving couples
G Rinaldi - Journal of Combinatorial Designs, 2024 - Wiley Online Library
We generalize the well‐known Oberwolfach problem posed by Ringel in 1967. We suppose
to have v 2 v2 couples (here v≥ 4 v≥4 is an even integer) and suppose that they have to be …
to have v 2 v2 couples (here v≥ 4 v≥4 is an even integer) and suppose that they have to be …
Some results on 1‐rotational Hamiltonian cycle systems
M Buratti, G Rinaldi, T Traetta - Journal of Combinatorial …, 2014 - Wiley Online Library
A Hamiltonian cycle system of (briefly, a HCS (v)) is 1‐rotational under a (necessarily binary)
group G if it admits G as an automorphism group acting sharply transitively on all but one …
group G if it admits G as an automorphism group acting sharply transitively on all but one …
On -pyramidal Hamiltonian cycle systems
RA Bailey, M Buratti, G Rinaldi… - Bulletin of the Belgian …, 2014 - projecteuclid.org
A Hamiltonian cycle system of the complete graph minus a $1 $--factor $ K_ {2v}-I $(briefly,
an HCS $(2v) $) is {\it $2 $-pyramidal} if it admits an automorphism group of order $2 v-2 …
an HCS $(2v) $) is {\it $2 $-pyramidal} if it admits an automorphism group of order $2 v-2 …
Enumerating the Walecki‐Type Hamiltonian Cycle Systems
E Brugnoli - Journal of Combinatorial Designs, 2017 - Wiley Online Library
Let be the complete graph on v vertices. A Hamiltonian cycle system of odd order v (briefly)
is a set of Hamiltonian cycles of whose edges partition the edge set of. By means of a slight …
is a set of Hamiltonian cycles of whose edges partition the edge set of. By means of a slight …
On the full automorphism group of a Hamiltonian cycle system of odd order
M Buratti, GJ Lovegrove, T Traetta - Graphs and Combinatorics, 2015 - Springer
It is shown that a necessary condition for an abstract group G to be the full automorphism
group of a Hamiltonian cycle system is that G has odd order or it is either binary, or the affine …
group of a Hamiltonian cycle system is that G has odd order or it is either binary, or the affine …