Claw-free and generalized bull-free graphs of large diameter are hamiltonian

In: Tatra Mountains Mathematical Publications, vol. 18, no. 4

Ralph J. Faudree - Zdeněk Ryjáček - Ingo Schiermeyer

Detaily:

Rok, strany: 1999, 105 - 113

O článku:

A generalized $(i,j)$-bull $B_i,j$ is a graph obtained by identifying each of some two distinct vertices of a triangle with an endvertex of one of two vertex-disjoint paths of lengths $i,j$. We prove that every 2-connected claw-free $B_2,j$-free graph of diameter at least $max {7,2j}$ $(j≥ 2)$ is hamiltonian.

Ako citovať:

ISO 690:

Faudree, R., Ryjáček, Z., Schiermeyer, I. 1999. Claw-free and generalized bull-free graphs of large diameter are hamiltonian. In Tatra Mountains Mathematical Publications, vol. 18, no.4, pp. 105-113. 1210-3195.

APA:

Faudree, R., Ryjáček, Z., Schiermeyer, I. (1999). Claw-free and generalized bull-free graphs of large diameter are hamiltonian. Tatra Mountains Mathematical Publications, 18(4), 105-113. 1210-3195.