论文信息 - A result on Hamiltonian line graphs involving restrictions on induced subgraphs

A result on Hamiltonian line graphs involving restrictions on induced subgraphs

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.

Henk Jan Veldman

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] Paul A. Catlin,et al. A reduction method to find spanning Eulerian subgraphs , 1988, J. Graph Theory.

[3] Hank Jan Veldman,et al. Existence of spanning and dominating trails and circuits , 1986, J. Graph Theory.

[4] Henk Jan Veldman,et al. On circuits and pancyclic line graphs , 1986, J. Graph Theory.

[5] Lane H. Clark. On hamiltonian line graphs , 1984, J. Graph Theory.

[6] F. Harary,et al. On Eulerian and Hamiltonian Graphs and Line Graphs , 1965, Canadian Mathematical Bulletin.

[7] David P. Sumner,et al. Every connected, locally connected nontrivial graph with no induced claw is hamiltonian , 1979, J. Graph Theory.

[8] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .

[9] Paul A. Catlin. Spanning eulerian subgraphs and matchings , 1989, Discret. Math..

[10] J. E. Williamson,et al. On Spanning and Dominating Circuits in Graphs , 1977, Canadian Mathematical Bulletin.

[11] Paul A. Catlin. Contractions of graphs with no spanning eulerian subgraphs , 1988, Comb..