Show simple item record

dc.contributor.advisorTravers, Brianen_US
dc.contributor.authorKeough, Kathryn
dc.creatorKeough, Kathrynen_US
dc.date2021-11-24T14:05:38.000en_US
dc.date.accessioned2021-11-29T11:33:16Z
dc.date.available2021-11-29T11:33:16Z
dc.date.issued2020-05-01en_US
dc.date.submitted2020-08-04T10:54:03-07:00en_US
dc.identifierhonors_theses/289en_US
dc.identifier.urihttp://hdl.handle.net/20.500.13013/766en_US
dc.description.abstractColoring is an important part of graph theory. Historically, it was thought that only four colors could be the minimal number of colors. This paper discusses the Four Color Theorem and how the Four Color Theorem is applied to graphs. This paper gives an overview of several different definitions involved with graphs and shows how to create a dual graph. This paper also discusses how a graph of 12 regions has at least one region bounded by less than five edges. The paper includes several figures which include graphs, dual graphs, and different colorings. The paper also provides a proof which shows mathematically why a graph of 12 regions has at least one region bounded by less than five edges.en_US
dc.titleExploring The Thirteen Colorful Variations Of Guthrie's Four-Color Conjectureen_US
dc.typeThesisen_US
dc.legacy.pubstatuspublisheden_US
dc.description.departmentMathematicsen_US
dc.date.displayMay-20en_US
dc.type.degreeBachelor of Fine Arts (BFA)en_US
dc.legacy.pubtitleHonors Thesesen_US
dc.legacy.identifierhttps://digitalcommons.salemstate.edu/cgi/viewcontent.cgi?article=1289&context=honors_theses&unstamped=1en_US
dc.legacy.identifieritemhttps://digitalcommons.salemstate.edu/honors_theses/289en_US
dc.subject.keywordcoloringen_US
dc.subject.keywordfour color theoremen_US
dc.subject.keywordgraphsen_US
dc.subject.keywordmathen_US
dc.subject.keywordregionsen_US


Files in this item

Thumbnail
Name:
keough_kathryn_LATE_3862432_85 ...
Size:
169.7Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record