Notes on sufficient conditions for a graph to be Hamiltonian
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.
Saved in:
Main Authors: | Michael Joseph Paul, Carmen Baytan Shershin, Anthony Connors Shershin |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1991-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Subjects: | |
Online Access: | http://dx.doi.org/10.1155/S0161171291001138 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On Feller's criterion for the law of the iterated logarithm
by: Deli Li, et al.
Published: (1994-01-01) -
A plane vertical submerged barrier in surface water waves
by: U. Basu, et al.
Published: (1987-01-01) -
«Priority Dispute» between Cauchy and Maclaurin or the History of a Mistake.
by: A. V. Yastrebov
Published: (2015-02-01) -
On characterization of the Cauchy law by sample mean properties
by: Romanas Januškevičius
Published: (2004-12-01) -
Hamiltonian-connected graphs and their strong closures
by: Pak-Ken Wong
Published: (1997-01-01)