A generalization of a result of Häggkvist and Nicoghossian

Douglas Bauer; Haitze J. Broersma; H.J. Veldman; Li Rao

doi:10.1016/0095-8956(89)90023-3

A generalization of a result of Häggkvist and Nicoghossian

Douglas Bauer, Haitze J. Broersma, H.J. Veldman, Li Rao

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

32 Citations (Scopus)

135 Downloads (Pure)

Abstract

Using a variation of the Bondy-Chvátal closure theorem the following result is proved: If G is a 2-connected graph with n vertices and connectivity κ such that d(x) + d(y) + d(z) ≥ n + κ for any triple of independent vertices x, y, z, then G is hamiltonian.

Original language	English
Pages (from-to)	237-243
Journal	Journal of Combinatorial Theory, Series B
Volume	47
Issue number	2
DOIs	https://doi.org/10.1016/0095-8956(89)90023-3
Publication status	Published - 1989

Keywords

IR-70575

Access to Document

10.1016/0095-8956(89)90023-3Licence: Other

Bauer89generalFinal published version, 451 KBLicence: Other

Cite this

@article{6bde149e6bbd4511b0326adf5c5ba092,

title = "A generalization of a result of H{\"a}ggkvist and Nicoghossian",

abstract = "Using a variation of the Bondy-Chv{\'a}tal closure theorem the following result is proved: If G is a 2-connected graph with n vertices and connectivity κ such that d(x) + d(y) + d(z) ≥ n + κ for any triple of independent vertices x, y, z, then G is hamiltonian.",

keywords = "IR-70575",

author = "Douglas Bauer and Broersma, {Haitze J.} and H.J. Veldman and Li Rao",

year = "1989",

doi = "10.1016/0095-8956(89)90023-3",

language = "English",

volume = "47",

pages = "237--243",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - A generalization of a result of Häggkvist and Nicoghossian

AU - Bauer, Douglas

AU - Broersma, Haitze J.

AU - Veldman, H.J.

AU - Rao, Li

PY - 1989

Y1 - 1989

N2 - Using a variation of the Bondy-Chvátal closure theorem the following result is proved: If G is a 2-connected graph with n vertices and connectivity κ such that d(x) + d(y) + d(z) ≥ n + κ for any triple of independent vertices x, y, z, then G is hamiltonian.

AB - Using a variation of the Bondy-Chvátal closure theorem the following result is proved: If G is a 2-connected graph with n vertices and connectivity κ such that d(x) + d(y) + d(z) ≥ n + κ for any triple of independent vertices x, y, z, then G is hamiltonian.

KW - IR-70575

U2 - 10.1016/0095-8956(89)90023-3

DO - 10.1016/0095-8956(89)90023-3

M3 - Article

SN - 0095-8956

VL - 47

SP - 237

EP - 243

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 2

ER -

A generalization of a result of Häggkvist and Nicoghossian

Abstract

Keywords

Access to Document

Fingerprint

Cite this