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: | , , |
|---|---|
| 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!
|
| _version_ | 1832552913545723904 |
|---|---|
| author | Michael Joseph Paul Carmen Baytan Shershin Anthony Connors Shershin |
| author_facet | Michael Joseph Paul Carmen Baytan Shershin Anthony Connors Shershin |
| author_sort | Michael Joseph Paul |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-582a50ceab5d4fbaa508a45305eeea4d |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1991-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-582a50ceab5d4fbaa508a45305eeea4d2025-02-03T05:57:31ZengWileyInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251991-01-0114482582710.1155/S0161171291001138Notes on sufficient conditions for a graph to be HamiltonianMichael Joseph Paul0Carmen Baytan Shershin1Anthony Connors Shershin2School of Computer Science, Florida International University, Miami 33199, Florida, USAMathematics Department, Ransom-Everglades School, Coconut Grove 33133, Florida, USAMathematics Department, Florida International University, Miami 33199, Florida, USAThe 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.http://dx.doi.org/10.1155/S0161171291001138hamilton cycledirected graphsGhouila-Houri Theoremstrongly connected digraphsDirac's TheoremOre's Theoremedge condition. |
| spellingShingle | Michael Joseph Paul Carmen Baytan Shershin Anthony Connors Shershin Notes on sufficient conditions for a graph to be Hamiltonian International Journal of Mathematics and Mathematical Sciences hamilton cycle directed graphs Ghouila-Houri Theorem strongly connected digraphs Dirac's Theorem Ore's Theorem edge condition. |
| title | Notes on sufficient conditions for a graph to be Hamiltonian |
| title_full | Notes on sufficient conditions for a graph to be Hamiltonian |
| title_fullStr | Notes on sufficient conditions for a graph to be Hamiltonian |
| title_full_unstemmed | Notes on sufficient conditions for a graph to be Hamiltonian |
| title_short | Notes on sufficient conditions for a graph to be Hamiltonian |
| title_sort | notes on sufficient conditions for a graph to be hamiltonian |
| topic | hamilton cycle directed graphs Ghouila-Houri Theorem strongly connected digraphs Dirac's Theorem Ore's Theorem edge condition. |
| url | http://dx.doi.org/10.1155/S0161171291001138 |
| work_keys_str_mv | AT michaeljosephpaul notesonsufficientconditionsforagraphtobehamiltonian AT carmenbaytanshershin notesonsufficientconditionsforagraphtobehamiltonian AT anthonyconnorsshershin notesonsufficientconditionsforagraphtobehamiltonian |