Hamiltonian decomposition of prisms over cubic graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2015

Hamiltonian decomposition of prisms over cubic graphs

Abstract

The prisms over cubic graphs are 4-regular graphs. The prisms over 3-connected cubic graphs are Hamiltonian. In 1986 Brian Alspach and Moshe Rosenfeld conjectured that these prisms are Hamiltonian decomposable. In this paper we present a short survey of the status of this conjecture, various constructions proving that certain families of prisms over 3-connected cubic graphs are Hamiltonian decomposable. Among others, we prove that the prisms over cubic Halin graphs, cubic generalized Halin graphs of order 4k + 2 and other infinite sequences of cubic graphs are Hamiltonian decomposable.

Keywords

Fichier principal
Vignette du fichier
dmtcs-16-2-9.pdf (303.58 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01185619 , version 1 (20-08-2015)

Identifiers

Cite

Moshe Rosenfeld, Ziqing Xiang. Hamiltonian decomposition of prisms over cubic graphs. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 16 no. 2 (2), pp.111--124. ⟨10.46298/dmtcs.2079⟩. ⟨hal-01185619⟩

Collections

TDS-MACS
63 View
1277 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More