A perfectly one-factorable (P1F) regular graph G 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. We consider cubic graphs. The existence of a P1F cubic graph is guaranteed for each admissible value of the number of vertices. We give conditions for determining P1F graphs within a subfamily of generalized Petersen graphs.
Perfect one-factorizations in generalized Petersen graphs / Bonvicini, S.; Mazzuoccolo, Giuseppe. - In: ARS COMBINATORIA. - ISSN 0381-7032. - STAMPA. - 99(2011), pp. 33-43.
Titolo: | Perfect one-factorizations in generalized Petersen graphs |
Autori: | |
Data di pubblicazione: | 2011 |
Rivista: | |
Citazione: | Perfect one-factorizations in generalized Petersen graphs / Bonvicini, S.; Mazzuoccolo, Giuseppe. - In: ARS COMBINATORIA. - ISSN 0381-7032. - STAMPA. - 99(2011), pp. 33-43. |
Abstract: | A perfectly one-factorable (P1F) regular graph G 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. We consider cubic graphs. The existence of a P1F cubic graph is guaranteed for each admissible value of the number of vertices. We give conditions for determining P1F graphs within a subfamily of generalized Petersen graphs. |
Handle: | http://hdl.handle.net/11562/927837 |
Appare nelle tipologie: | 01.01 Articolo in Rivista |
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.