Partitioning a Graph into Two Square-Cycles

Journal of Graph Theory

Volumn 23, Issue 3, 1996, Pages 241-256

  Fan, Genghua ^a   Kierstead, H A ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030504851     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199611)23:3<241::AID-JGT4>3.0.CO;2-S     Document Type: Article

References (7)

1. G. A. Dirac, Some theorems on abstract graphs. Proc. London Math Soc. 2 (1952), 68-81.
2. P. Erdös, Problem 9, Theory of Graphs and its Applications (M. Fieldler ed.), Czech. Acad. Sci. Publ., Prague (1964), 159.
3. G. Fan and R. Häggkvist, The square of a hamiltonian cycle, SIAM J. Discrete Math., 203-212.
4. G. Fan and H. A. Kierstead, The square of paths and cycles, J. Combinat. Theory Ser. B 63 (1995), 55-64.
5. G. Fan and H. A. Kierstead, Hamiltonian square-paths, preprint, J. Combinat. Theory Ser. B, in press.
6. A. Hajnal and E. Szemerédi, Proof of a conjecture of P. Erdös, Combinatorial Theory and its Application (P. Erdös, A. Rényi, and Vera T. Sós eds), North-Holland, London (1970), 601-623.
7. P. Seymour, Problem section, Combinatorics: Proceedings of the British Combinatorial Conference 1973 (T. P. McDonough and V. C. Mavron eds), Cambridge University Press, Cambridge (1974), 201-202.