论文信息 - Forbidden subgraphs and Hamiltonian properties of graphs

Forbidden subgraphs and Hamiltonian properties of graphs

Various sufficient conditions are given, in terms of forbidden subgraphs, that imply a graph is either homogeneously traceable, hamiltonian or pancyclic.

Michael S. Jacobson | Ronald J. Gould

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

[2] S. Hedetniemi,et al. Sufficient conditions for a graph to be Hamiltonian , 1974 .

[3] Ronald J. Gould. Traceability in Graphs , 1979 .

[4] Gary Chartrand,et al. ON HOMOGENEOUSLY TRACEABLE NONHAMILTONIAN GRAPHS , 1979 .