Forbidden subgraphs that imply Hamiltonianconnectedness
Broersma, H.J. and Faudree, R.J. and Huck, A. and Trommel, H. and Veldman, H.J. (1999) Forbidden subgraphs that imply Hamiltonianconnectedness. [Report]

PDF
237kB 
Abstract:  It is proven that if is a connected clawfree graph which is also free (where is a triangle with a path of length attached), free (where is a path with vertices) or free (where consists of two disjoint triangles connected by an edge), then is Hamiltonianconnected. Also, examples will be described that determine a finite family of graphs such that if a 3connected graph being clawfree and free implies is Hamiltonianconnected, then .

Item Type:  Report 
Copyright:  © 1999 University of Twente, Faculty of Mathematical Sciences 
Faculty:  Electrical Engineering, Mathematics and Computer Science (EEMCS) 
Research Group:  
Link to this item:  http://purl.utwente.nl/publications/65670 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page