Hamiltonian decompositions of prisms over cubic graphs

Discrete Mathematics

Volumn 286, Issue 1-2, 2004, Pages 45-56

  Čada, Roman ^a,b   Kaiser, Tomáš ^a,b   Rosenfeld, Moshe ^c   Ryjáček, Zdeněk ^a  

^a UNIVERSITY OF WEST BOHEMIA   (Czech Republic)

^b CHARLES UNIVERSITY   (Czech Republic)

^c UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Cubic graph; Hamilton cycle; Hamiltonian decomposition; Prism

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECOMPOSITION; FINITE DIFFERENCE METHOD; GRAPH THEORY; HAMILTONIANS; THEOREM PROVING;

HAMILTON CYCLE; HAMILTONIAN DECOMPOSITION; PARTIAL MATCHING;

PRISMS;

EID: 4344674787     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2003.11.044     Document Type: Conference Paper

References (7)

1. Alspach B., Rosenfeld M. On Hamilton decompositions of prisms over simple 3-polytopes. Graphs Combin. 2:1986;1-8.
2. Batagelj V. Inductive definition of two restricted classes of triangulations. Discrete Math. 52:1984;113-121.
3. Bondy J.A., Murty U.S.R. Graph Theory with Applications. 1976;Macmillan, London.
4. T. Fowler, Unique coloring of planar graphs, Ph.D. Thesis, Georgia Institute of Technology, Atlanta, 1998.
5. W. McCuaig, personal communication.
6. Paulraja P. A characterization of hamiltonian prisms. J. Graph Theory. 17:1993;161-171.
7. Rosenfeld M., Barnette D. Hamiltonian circuits in certain prisms. Discrete Math. 5:1973;389-394.