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 automorphism group 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.

Primitive 2-factorizations of the complete graph

Mazzuoccolo, Giuseppe
2008-01-01

Abstract

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 automorphism group 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.
2008
Factorization, Coloring of graphs and hypergraphs, Graphs and groups
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11562/927852
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact