EEMCS

Full text available as:

PDF - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 227 Kb

Official URL: http://dx.doi.org/10.1002/jgt.20558

Abstract

An hourglass is the only graph with degree sequence 4, 2, 2, 2, 2 (i.e. two triangles meeting in exactly one vertex). There are infinitely many claw-free graphs G such that G is not hamiltonian connected while its Ryjác̆ek closure cl(G) is hamiltonian connected. This raises such a problem what conditions can guarantee that a claw-free graph G is hamiltonian connected if and only if cl(G) is hamiltonian connected. In this paper, we will do exploration toward the direction, and show that a 3-connected -free graph G with minimum degree at least 4 is hamiltonian connected if and only if cl(G) is hamiltonian connected, where is the square of a path on 6 vertices. Using the result, we prove that every 4-connected -free graph is hamiltonian connected, hereby generalizing the result that every 4-connected hourglass-free line graph is hamiltonian connected by Kriesell [J Combinatorial Theory (B) 82 (2001), 306–315].

Export this item as:

• BibTeX
• XML

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item