Name
Abstract | ||
|---|---|---|
A graph G is said to be claw-free if G has no induced subgraph isomorphic to K 1 , 3 . For a cycle C in a graph G, C is called a Tutte cycle of G if C is a Hamilton cycle of G, or the order of C is at least 4 and every component of G - C has at most three neighbors on C. Ryjáček (1997) 17] proved that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is Hamiltonian) and by Thomassen (every 4-connected line graph is Hamiltonian) are equivalent. In this paper, we show the above conjectures are equivalent with the conjecture by Jackson in 1992 (every 2-connected claw-free graph has a Tutte cycle). |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jctb.2015.04.001 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Hamiltonian,Claw-free graphs,Line graphs,Tutte cycles | Tutte 12-cage,Discrete mathematics,Combinatorics,Graph toughness,Graph power,Cubic graph,Polyhedral graph,Cycle graph,Graph minor,Petersen graph,Mathematics | Journal |
Volume | Issue | ISSN |
114 | C | 0095-8956 |
Citations | PageRank | References |
0 | 0.34 | 16 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Cada | 1 | 40 | 8.35 |
| Shuya Chiba | 2 | 35 | 12.93 |
| Kenta Ozeki | 3 | 138 | 36.31 |
| Petr Vrána | 4 | 96 | 12.89 |
| Kiyoshi Yoshimoto | 5 | 133 | 22.65 |