On disjoint hamiltonian cycles in bipartite graphs
This paper is an exposition about the article written by Ferrara, Gould, Tansey and Whalen entitled Disjoint hamiltonian cycles in bipartite graphs which appeared on Discrete Mathematics vol. 309 (2009). Basic concepts and proofs of some theorems and lemmas were presented. The authors focused on the...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2014
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/18001 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | This paper is an exposition about the article written by Ferrara, Gould, Tansey and Whalen entitled Disjoint hamiltonian cycles in bipartite graphs which appeared on Discrete Mathematics vol. 309 (2009). Basic concepts and proofs of some theorems and lemmas were presented. The authors focused on the proof that for any balanced bipartite with sufficiently large number of vertices, its degree-sum ensures the existence of k edge-disjoint hamiltonian cycles. In this paper, we study proofs and conditions that are needed in order to produce k systems of edge-disjoint paths and show that they can be extended to k edge-disjoint hamiltonian cycles. |
|---|