Show simple item record

dc.contributor.authorSean, Zimmerman
dc.date.accessioned2013-09-07T04:09:07Z
dc.date.available2013-09-07T04:09:07Z
dc.date.issued2013-09-07
dc.identifier.urihttp://hdl.handle.net/1974/8256
dc.description.abstractIn this paper we present a survey of various lower bounds on graph chromatic number. We present lower bounds derived both from elementary graph invariants, as well as invariants of topological spaces derived from the combinatorial structure of graphs. We discuss the graph U(5,3) as an example where some of these bounds differ.en_US
dc.language.isoenen_US
dc.subjectGraph Theoryen_US
dc.subjectTopologyen_US
dc.subjectGraph Coloringen_US
dc.titleTopological and Algebraic Lower Bounds on the Chromatic Number of Graphsen_US
dc.typeprojecten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record