Hamiltonian square-paths

Journal of Combinatorial Theory. Series B

Volumn 67, Issue 2, 1996, Pages 167-182

  Fan, Genghua ^a   Kierstead, H A ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030187173     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.0039     Document Type: Article

References (9)

1. 1. M. AIGNER AND S. BRANDT, Embedding arbitrary graphs of maximum degree two, J. London Math. Soc. 48 (1993), 39-51.
2. 2. B. BOLLABÁS AND S. E. ELDRIDGE, Packings of graphs and applications to computational complexity, J. Combin. Theory Ser. B 25 (1978), 105-124.
3. 3. G. A. DIRAC, Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1952), 68-81.
4. 4. P. ERDÖS, Problem 9, in "Theory of Graphs and Its Applications" (M. Fieldler, Ed.), p. 159, Czech. Acad. Sci. Publ., Prague, 1964.
5. 5. G. FAN AND R. HÄGGKVIST, The square of a hamiltonian cycle, SIAM J. Discrete Math. 7 (1994), 203-212.
6. 6. G. FAN AND H. A. KIERSTEAD, The square of paths and cycles, J. Combinatorial Theory Ser. B 63 (1995), 55-64.
7. 7. G. FAN AND H. A. KIERSTEAD, Partioning a graph into two square-cycles, preprint.
8. 8. A. HAJNAL AND E. SZEMERÉDI, Proof of a conjecture of P. Erdös, in "Combinatorial Theory and its Application" (P. Erdös, A. Rényi, and V. T. Sós, Eds.), pp. 601-623, North-Holland, London, 1970.
9. 9. P. SEYMOUR, Problem section, in "Combinatorics: Proceedings of the British Combinatorial Conference 1973" (T. P. McDonough and V. C. Mavron, Eds.), pp. 201-202, Cambridge Univ. Press, Cambridge, UK, 1974.