Dirac type condition and Hamiltonian graphs

Zhao, Kewen. "Dirac type condition and Hamiltonian graphs." Serdica Mathematical Journal 37.4 (2011): 277-282. <http://eudml.org/doc/281564>.

@article{Zhao2011,
abstract = {2010 Mathematics Subject Classification: 05C38, 05C45.In 1952, Dirac introduced the degree type condition and proved that if G is a connected graph of order n і 3 such that its minimum degree satisfies d(G) і n/2, then G is Hamiltonian. In this paper we investigate a further condition and prove that if G is a connected graph of order n і 3 such that d(G) і (n-2)/2, then G is Hamiltonian or G belongs to four classes of well-structured exceptional graphs.},
author = {Zhao, Kewen},
journal = {Serdica Mathematical Journal},
keywords = {Type Condition; Sufficient Condition; Hamiltonian Graph; Dirac type condition; Hamiltonian graph},
language = {eng},
number = {4},
pages = {277-282},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Dirac type condition and Hamiltonian graphs},
url = {http://eudml.org/doc/281564},
volume = {37},
year = {2011},
}

TY - JOUR
AU - Zhao, Kewen
TI - Dirac type condition and Hamiltonian graphs
JO - Serdica Mathematical Journal
PY - 2011
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 37
IS - 4
SP - 277
EP - 282
AB - 2010 Mathematics Subject Classification: 05C38, 05C45.In 1952, Dirac introduced the degree type condition and proved that if G is a connected graph of order n і 3 such that its minimum degree satisfies d(G) і n/2, then G is Hamiltonian. In this paper we investigate a further condition and prove that if G is a connected graph of order n і 3 such that d(G) і (n-2)/2, then G is Hamiltonian or G belongs to four classes of well-structured exceptional graphs.
LA - eng
KW - Type Condition; Sufficient Condition; Hamiltonian Graph; Dirac type condition; Hamiltonian graph
UR - http://eudml.org/doc/281564
ER -