Georgia Southern University
The Forcing and Forbidding of Rainbow-Colored Subgraphs with Implications
Abstract
dc:description.abstractThe most famous problem in Graph Theory is arguably one involving the coloring of graphs so that maps may be further studied. Having many impressive applications, graph coloring has appropriately generated a vast amount of interest, something now manifested in an abundance of research. As a small contribution to the field, the objective of this thesis is to further investigate certain possibilities of graph coloring where rainbow-colored subgraphs are of special interest. In particular, the conditions forcing the existence of multicolored paths and the structures formed by forbidding certain rainbow-colored subgraphs will be explored.
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Mathematics (M.S.)
- Level thesis:degree_level
- Thesis (restricted to Georgia Southern)
- Discipline thesis:degree_discipline
- Department of Mathematical Sciences
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Pyron, Brian A.
- Contributors dc:contributor
-
- Zhuojun Magnant
- Hua Wang
Subjects
dc:subject × 4Rights
- Licence dc:rights.license
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.georgiasouthern.edu/etd/1454