
doi: 10.1002/jgt.10034
AbstractIt is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1 consists of two disjoint triangles connected by an edge), then G is hamiltonian‐connected. Also, examples will be described that determine a finite family of graphs ${\cal L}$ such that if a 3‐connected graph being claw‐free and L‐free implies G is hamiltonian‐connected, then L $\in \cal L$. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 104–119, 2002
Claw-free graph, Eulerian and Hamiltonian graphs, IR-71892, Hamiltonian-connected, Forbidden subgraph, METIS-206789
Claw-free graph, Eulerian and Hamiltonian graphs, IR-71892, Hamiltonian-connected, Forbidden subgraph, METIS-206789
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 15 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
