Hamiltonian threshold for strong products of graphs

Journal of Graph Theory

Volumn 58, Issue 4, 2008, Pages 314-328

  Král, Daniel ^a   Stacho, Ladislav ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Hamilton cycle; Strong graph product

Indexed keywords

HAMILTONIANS;

CONNECTED GRAPH; HAMILTON CYCLE; MAXIMUM DEGREE; NON-TRIVIAL; PANCYCLIC; STRONG GRAPH PRODUCT; STRONG PRODUCT;

GRAPH THEORY;

EID: 48849113006     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20314     Document Type: Article

References (15)

1. A. Amahashi and M. Kano, On factors with given components, Discrete Math 42 (1982), 1-6.
2. D. Barnette and M. Rosenfeld, Hamiltonian circuits in certain prisms, Discrete Math 5 (1973), 389-394.
3. J. C. Bermond, A. Germa, and M. C. Heydemann, Hamiltonian cycles in strong products of graphs, Canad Math Bull 22(3) (1979), 305-309.
4. J. A. Bondy, Basic graph theory: Paths and circuits, In: Handbook of Combinatorics, North-Holland, Amsterdam, 1995, pp. 3-110.
5. V. Chvátal, Hamiltonian cycles, In: E. L. Lawler, E. L. Lenstra, and D. B. Shmoys (Editors), The Traveling Salesman Problem - A Guided Tour of Combinatorial Optimization, John Wiley & Sons, Chichester, 1985, pp. 403-429.
6. W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver, Combinatorial Optimization, Wiley Interscience Series in Discrete Mathematics and Optimization, John Wiley and Sons, New York, 1998.
7. R. Diestel, Graph Theory, Graduate Texts in Mathematics, Vol. 173, Springer-Verlag, New York, 2000.
8. R. J. Gould, Advances on the Hamiltonian problem - A survey, Graphs Comb 19(1) (2003), 7-52.
9. R. J. Gould, Updating the Hamiltonian problem, J Graph Theory 15 (1991), 121-157.
10. D. Král', J. Maxová, P. Podbrdský, and R. Šámal, Hamilton cycles in strong products of graphs, J Graph Theory 54(3) (2006), 209-220.
11. D. Král', J. Maxová, P. Podbrdský, and R. Šámal, Pancyclicity of strong products of graphs, Graphs Comb 20(1) (2004), 91-104.
12. C. D. Savage, A survey of combinatorial Gray codes, SIAM Rev 39(4) (1997), 605-629.
13. A. Schrijver, Theory of Linear and Integer Programming, John Wiley and Sons, Chichester, 1986.
14. A. Schrijver, Combinatorial Optimization, Polyhedra and Efficiency, Series: Algorithms and Combinatorics, Vol. 24, Springer-Verlag, Heidelberg, 2003.
15. J. Zaks, Hamiltonian cycles in products of graphs, Canadian Math Bull 17(5) (1975), 763-765.