Both chordal and weakly chordal graphs have been topics of research in graph theory for many years. Upon reading their definitions it is clear that the weakly chordal class of graphs is a relaxation of the chordal condition for graphs. The question is then asked could we possibly find and study the properties if we, in turn, relaxed the weakly chordal condition for graphs? We start by providing the definitions and basic results needed later on. In the second chapter, we discuss perfect graphs, some of their properties, and some subclasses that were researched. The third chapter is focused on a new class of graphs, the definition of which relaxes the restrictions for chordal and weakly chordal graphs, and extends certain results from weakly chordal graphs to this class.
| Identifer | oai:union.ndltd.org:MSSTATE/oai:scholarsjunction.msstate.edu:td-6183 |
| Date | 06 August 2021 |
| Creators | Hathcock, Benjamin Lee |
| Publisher | Scholars Junction |
| Source Sets | Mississippi State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Theses and Dissertations |
Page generated in 0.0019 seconds