Dirac type condition and Hamiltonian graphs

Zhao, Kewen

Serdica Mathematical Journal (2011)

  • Volume: 37, Issue: 4, page 277-282
  • ISSN: 1310-6600

Abstract

top
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.

How to cite

top

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 -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.