Square Hamiltonian cycles in graphs with maximal 4-cliques

Discrete Mathematics

Volumn 178, Issue 1-3, 1998, Pages 81-92

  Kierstead, H A ^a   Quintana, Juan ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037944986     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)81819-5     Document Type: Article

References (8)

1. G.A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1952) 68-81.
2. P. Erdös, Problem 9, in: M. Fieldler, ed., Theory of Graphs and Applications (Czech. Acad. Sci. Publ., Prague, 1964) 159.
3. G. Fan and R. Häggkvist, The square of a hamiltonian cycle, SIAM J. Discrete Math. (1994) 203-212.
4. G. Fan and H.A. Kierstead, The square of paths and cycles, J. Combin. Theory Series B 63 (1995) 55-64.
5. G. Fan and H.A. Kierstead, Hamiltonian square-paths, J. Combin. Theory B 67 (1996) 167-182.
6. G. Fan and H.A. Kierstead, Partitioning a graph into two square-cycles, J. Graph Theory 23 (1996) 241-256.
7. J. Komlȯs, G. Sárközy and E. Szemerédi, On the square of a hamiltonian cycle in dense graphs, preprint.
8. P. Seymour, Problem Section, in: T.P. McDonough and V.C. Mavron, eds., Combinatorics: Proc. British Combinatorial Conf. 1973 (Cambridge University Press, Cambridge, UK, 1974) 201-202.