A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into one-factors such that the union of any two of them is a Hamiltonian cycle. The case of cubic graphs is treated. The existence of a P1F cubic graph is guaranteed for each admissible value of the number of vertices. A description of this class was obtained by Kotzig in 1962. It is the purpose of the present paper to produce an alternative proof of Kotzig’s result.

A new description of perfectly one-factorable cubic graphs

Mazzuoccolo, Giuseppe
2006-01-01

Abstract

A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into one-factors such that the union of any two of them is a Hamiltonian cycle. The case of cubic graphs is treated. The existence of a P1F cubic graph is guaranteed for each admissible value of the number of vertices. A description of this class was obtained by Kotzig in 1962. It is the purpose of the present paper to produce an alternative proof of Kotzig’s result.
One-factorization, Hamiltonian cycle, Perfect one-factorization, Graph-modifications
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/927936
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact