Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable
| dc.contributor.author | Sullivan, Matthew | |
| dc.date.accessioned | 2016-09-16T19:40:53Z | |
| dc.date.available | 2016-09-16T19:40:53Z | |
| dc.date.issued | 2016-09-16 | |
| dc.date.submitted | 2016-09 | |
| dc.description.abstract | A graph G is said to be L-colourable if for a given list assignment L = {L(v)|v ∈ V (G)} there is a proper colouring c of G such that c(v) ∈ L(v) for all v in V (G). If G is L-colourable for all L with |L(v)| ≥ k for all v in V (G), then G is said to be k-choosable. This paper focuses on two different ways to prove list colouring results on planar graphs. The first method will be discharging, which will be used to fuse multiple results into one theorem. The second method will be restricting the lists of vertices on the boundary and applying induction, which will show that planar graphs without 3- cycles and 4-cycles distance 8 apart are 3-choosable. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/10859 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.subject | Graph Theory | en |
| dc.subject | Graph Colouring | en |
| dc.title | Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws-etd.degree.discipline | Combinatorics and Optimization | en |
| uws-etd.degree.grantor | University of Waterloo | en |
| uws.contributor.advisor | Richter, Bruce | |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.published.city | Waterloo | en |
| uws.published.country | Canada | en |
| uws.published.province | Ontario | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |