Premium
A result on Hamiltonian line graphs involving restrictions on induced subgraphs
Author(s) -
Veldman H. J.
Publication year - 1988
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190120312
Subject(s) - combinatorics , mathematics , line graph , hamiltonian path , graph , vertex (graph theory) , hamiltonian (control theory) , discrete mathematics , mathematical optimization
It is shown that the existence of a Hamilton cycle in the line graph of a graph G can be ensured by imposing certain restrictions on certain induced subgraphs of G. Thereby a number of known results on hamiltonian line graphs are improved, including the earliest results in terms of vertex degrees. One particular consequence is that every graph of diameter 2 and order at least 4 has a hamiltonian line graph.