Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Results On Edge-Colored Graphs And Pancyclicity, James Carraher
Results On Edge-Colored Graphs And Pancyclicity, James Carraher
Department of Mathematics: Dissertations, Theses, and Student Research
This thesis focuses on determining when a graph with additional structure contains certain subgraphs, particularly circuits, cycles, or trees. The specific problems and presented results include a blend of many fundamental graph theory concepts such as edge-coloring, routing problems, decomposition problems, and containing cycles of various lengths. The three primary chapters in this thesis address the problems of finding eulerian circuits with additional restrictions, decomposing the edge-colored complete graph K_n into rainbow spanning trees, and showing a 4-connected claw-free and N(3,2,1)-free graph is pancyclic.
Adviser: Stephen G. Hartke