Notes on sufficient conditions for a graph to be Hamiltonian

Michael Joseph Paul, Carmen Baytan Shershin and Anthony Connors Shershin

International Journal of Mathematics and Mathematical Sciences, 1991, vol. 14, 1-3

Abstract:

The first part of this paper deals with an extension of Dirac's Theorem to directed graphs. It is related to a result often referred to as the Ghouila-Houri Theorem. Here we show that the requirement of being strongly connected in the hypothesis of the Ghouila-Houri Theorem is redundant.

The Second part of the paper shows that a condition on the number of edges for a graph to be hamiltonian implies Ore's condition on the degrees of the vertices.

Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/14/875792.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/14/875792.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:875792

DOI: 10.1155/S0161171291001138

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().