Name
Abstract | ||
|---|---|---|
We present ( 9 4 −ε) -tough graphs without a Hamilton path for arbitrary ε>0 , thereby refuting a well-known conjecture due to Chvátal. We also present ( 7 4 −ε) -tough chordal graphs without a Hamilton path for any ε>0 . |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0166-218X(99)00141-9 | Discrete Applied Mathematics |
Keywords | Field | DocType |
05c35,2-tough graph,chordal graph,05c38,toughness,05c45,hamiltonian graph,traceable graph | Graph theory,Discrete mathematics,Combinatorics,Indifference graph,Hamiltonian path,Chordal graph,Hamiltonian path problem,Connectivity,Pathwidth,Longest path problem,Mathematics | Journal |
Volume | Issue | ISSN |
99 | 1 | Discrete Applied Mathematics |
Citations | PageRank | References |
31 | 2.09 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| D. Bauer | 1 | 204 | 38.81 |
| H. J. Broersma | 2 | 266 | 33.68 |
| H. J. Veldman | 3 | 262 | 44.44 |