MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  The

Download:
pdf | ps
by Ingo Schiermeyer, Lehrstuhl C Fur Mathematik
http://www.cam.zcu.cz/~ryjacek/publications/./files/21.ps
Add To MetaCart

Abstract:

flower conjecture in special classes of graphs

Citations

889 Graph Theory with Applications – Bondy, Murty - 1976
21 The square of Every Two-Connected Graph is Hamiltonian – Fleischner
2 the squares of graphs, hamiltonicity and pancyclicity, hamiltonian connectedness and panconnectedness are equivalent concepts. Monatshefte fur – Fleischner - 1976
1 Research problem – Kaneko
1 K.: The flower property implies 1-toughness and the existence of a 2-factor. Manuscript (unpublished – Kaneko, Ota