Unifying results on Hamiltonian claw-free graphs

In: Tatra Mountains Mathematical Publications, vol. 9, no. 3

Hajo J. Broersma - Zdeněk Ryjáček - Ingo Schiermeyer

Detaily:

Rok, strany: 1996, 31 - 39

O článku:

This work was motivated by many (recent) papers on hamiltonicity of claw-free graphs, i.e., graphs that do not contain $K_1,3$ as an induced subgraph. By combining ideas from these papers with some new observations, we unify several of the existing sufficiency results, using a new sufficient condition consisting of seven subconditions. If each pair of vertices at distance two of a 2-connected claw-free graph $G$ satisfies at least one of these subconditions, then $G$ is Hamiltonian. We also present infinite classes of examples of graphs showing that these subconditions are, in some sense, independent.

Ako citovať:

ISO 690:

Broersma, H., Ryjáček, Z., Schiermeyer, I. 1996. Unifying results on Hamiltonian claw-free graphs. In Tatra Mountains Mathematical Publications, vol. 9, no.3, pp. 31-39. 1210-3195.

APA:

Broersma, H., Ryjáček, Z., Schiermeyer, I. (1996). Unifying results on Hamiltonian claw-free graphs. Tatra Mountains Mathematical Publications, 9(3), 31-39. 1210-3195.