A Sufficient Condition for Hamiltonian Connectedness in Standard 2-Colored Multigraphs

Autor:	Bruno, Nicholas J.
Jazyk:	angličtina
Rok vydání:	2015
Předmět:	Mathematics graph theory Dirac combinatorics Hamiltonian H-linked K-linked multigraph directed graph colored graph minimum degree Hamiltonian cycles Hamiltonian connected Hamilton connected
Druh dokumentu:	Text
Popis:	There have been many generalizations of Dirac's Theorem to more complex structures within graphs. I will present a proof that any standard 2-colored multigraph with minimum semi degree at least (1/2+ε)n is Hamiltonian Connected through paths of any color pattern. I will also present how this proof can be generalized to a much stronger condition that will relate to many previous results in this area. The proof will involve the idea of structures called Sorters and Pipelines and will follow closely the ideas within a proof by Haggkvist and Thomassen for arbitrarily orientedcycles in oriented graphs.
Databáze:	Networked Digital Library of Theses & Dissertations
Externí odkaz:	http://rave.ohiolink.edu/etdc/view?acc_num=miami1438385443 Zobrazit plný text záznamu