@article{oai:iwate-u.repo.nii.ac.jp:00011356,
 author = {押切, 源一},
 journal = {岩手大学教育学部研究年報},
 month = {Feb},
 note = {Let G be a connected claw-free simple graph with, G, ≥ 3. We show that if the 2-dimensional simplicial complex △ (G) associated to G is simply connected then G is\
hamiltonian. A graph G is said to be △1-connected if every pair of edges are onnected\
by some chain consisting of edges and triangles. We also show that if G is △1-connected then G is hamiltonian.},
 pages = {47--52},
 title = {Hamiltonian Property of Claw-free Graphs from the View Point of Topological Combinatorics},
 volume = {68},
 year = {2008}
}