List-Edge Coloring Planar Graphs with Bounded Maximum Degree
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | McDonald, Jessica | |
| dc.contributor.author | Harrelson, Joshua | |
| dc.date.accessioned | 2019-07-23T17:55:34Z | |
| dc.date.available | 2019-07-23T17:55:34Z | |
| dc.date.issued | 2019-07-23 | |
| dc.identifier.uri | http://hdl.handle.net/10415/6870 | |
| dc.description.abstract | In this thesis we prove that triangulations of maximum degree 5 are 6-list-edge-colorable. We also find necessary conditions for maximum degree to extend a list-edge-precoloring to E(G) for a planar graph G. The techniques used for these two results are the kernel method, the quantitative combinatorial nullstellensatz, and the discharging method. | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | List-Edge Coloring Planar Graphs with Bounded Maximum Degree | en_US |
| dc.type | PhD Dissertation | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |