Title

On disjoint hamiltonian cycles in bipartite graphs

Date of Publication

2014

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

Subject Categories

Physical Sciences and Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics Department

Abstract/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.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTU019175

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

This document is currently not available here.

Share

COinS