On degree sums, k-factors, and Hamiltonian cycles in graphs
This paper is an exposition of the article entitled Degree Sums, k-Factors, and Hamiltonian Cycles by R. J. Faudree and J. van den Heuvel which appeared in the journal Graphs and Combinatorics in 1995.The main result of this paper is the following theorem: Let G be a 2-connected graph on n vertices...
Saved in:
Main Author: | Hernandez, Alana Margarita R. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2002
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/3015 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
On 2-factor hamiltonian regular bipartite graphs
by: Ku, C.Y., et al.
Published: (2014) -
Finding Hamiltonian cycles: An algorithm
by: Macapagal, Rachel R., et al.
Published: (2008) -
Chip firing games on the n-cycles and tree graphs
by: Ching, Mike Lester L.
Published: (1998) -
On r-regular subgraphs with hamiltonian cycles in graphs with many edges
by: Yeaw Ku, C., et al.
Published: (2016) -
The terwilliger algebra of a distance-regular graph
by: Go, Junie T.
Published: (1999)