Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices.If F consists of Hamiltonian cycles, then F is the unique, up to isomorphisms, 2-factorization of Kpn admitting an automorphismgroup which acts 2-transitively on the vertex-set. In the non-Hamiltonian case we construct an infinite family of examples whose automorphism group does not contain a subgroup acting 2-transitively on vertices
AbstractLet S2n be the symmetric group of degree 2n. We give a strong indication to prove the existe...
Let S_2n be the symmetric group of degree 2n. We give a strong indication to prove the existence of ...
A 2-factorization of a simple graph $\Gamma$ is called 2-pyramidal if it admits an automorphism grou...
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primiti...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting doubly ...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
We consider 2-factorizations of the complete graph Kv whose automorphism group is ”rich” in some sen...
We consider 2-factorizations of complete graphs which possess an automorphism group fixing k\ge 0 ve...
Let be a 2-factorization of the complete graph Kv admitting an automorphism group G acting doubly t...
For which groups G of even order 2n does a 1-factorization of the complete graph on 2n veritces exis...
We introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-factorization...
AbstractWe introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-facto...
We introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-factorizatio...
AbstractThe following problem has arisen in the study of graphs, lattices and finite topologies. Is ...
AbstractLet S2n be the symmetric group of degree 2n. We give a strong indication to prove the existe...
Let S_2n be the symmetric group of degree 2n. We give a strong indication to prove the existence of ...
A 2-factorization of a simple graph $\Gamma$ is called 2-pyramidal if it admits an automorphism grou...
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primiti...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting doubly ...
AbstractLet F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting...
We consider 2-factorizations of the complete graph Kv whose automorphism group is ”rich” in some sen...
We consider 2-factorizations of complete graphs which possess an automorphism group fixing k\ge 0 ve...
Let be a 2-factorization of the complete graph Kv admitting an automorphism group G acting doubly t...
For which groups G of even order 2n does a 1-factorization of the complete graph on 2n veritces exis...
We introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-factorization...
AbstractWe introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-facto...
We introduce the concept of a 2-starter in a group G of odd order. We prove that any 2-factorizatio...
AbstractThe following problem has arisen in the study of graphs, lattices and finite topologies. Is ...
AbstractLet S2n be the symmetric group of degree 2n. We give a strong indication to prove the existe...
Let S_2n be the symmetric group of degree 2n. We give a strong indication to prove the existence of ...
A 2-factorization of a simple graph $\Gamma$ is called 2-pyramidal if it admits an automorphism grou...
DOI
Add to ORKG