3Connected line graphs of triangular graphs are panconnected and 1hamiltonian
Broersma, H.J. and Veldman, H.J. (1987) 3Connected line graphs of triangular graphs are panconnected and 1hamiltonian. Journal of Graph Theory, 11 (3). pp. 399407. ISSN 03649024

PDF
360kB 
Abstract:  A graph is ktriangular if each edge is in at least k triangles. Triangular is a synonym for 1triangular. It is shown that the line graph of a triangular graph of order at least 4 is panconnected if and only if it is 3connected. Furthermore, the line graph of a ktriangular graph is khamiltonian if and only if it is (k + 2)connected (k ≥ 1). These results generalize work of Clark and Wormald and of LesniakFoster. Related results are due to Oberly and Sumner and to Kanetkar and Rao. 
Item Type:  Article 
Copyright:  © 1987 Wiley InterScience 
Faculty:  Electrical Engineering, Mathematics and Computer Science (EEMCS) 
Research Group:  
Link to this item:  http://purl.utwente.nl/publications/70828 
Official URL:  http://dx.doi.org/10.1002/jgt.3190110314 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page