Name
Abstract | ||
|---|---|---|
It 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 The first four authors dedicate this paper to Henk Jan Veldman, a valued colleague and beloved friend who died October 12, 1998. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1002/jgt.v40:2 | Siam Journal on Control and Optimization |
Keywords | Field | DocType |
3-connected graph,wiley periodicals,inc. j graph theory,finite family,3-connected claw-free graph,cal l,disjoint triangle,beloved friend,henk jan veldman,claw free graph | Discrete mathematics,Combinatorics,Line graph,Graph power,Forbidden graph characterization,Graph factorization,Distance-hereditary graph,Cograph,Mathematics,Perfect graph theorem,Planar graph | Journal |
Volume | Issue | ISSN |
40 | 2 | 0364-9024 |
Citations | PageRank | References |
1 | 0.37 | 2 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. J. Broersma | 1 | 1 | 0.37 |
| Ralph J. Faudree | 2 | 559 | 92.90 |
| Andreas Huck | 3 | 76 | 6.61 |
| Huib Trommel | 4 | 3 | 0.74 |
| H. J. Veldman | 5 | 262 | 44.44 |