Shows the hamiltonian nature of claw-free graphs related to simplicial complexes, indicating new insights into graph properties.
≥ 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.
No takes yet. Share an insight, caveat, or question.
源一 押切 (2008) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: