List Coloring Some Classes of 1-Planar Graphs
| dc.contributor.author | Barr, Sam | |
| dc.date.accessioned | 2021-12-23T15:45:21Z | |
| dc.date.available | 2021-12-23T15:45:21Z | |
| dc.date.issued | 2021-12-23 | |
| dc.date.submitted | 2021-12-17 | |
| dc.description.abstract | In list coloring we are given a graph G and a list assignment for G which assigns to each vertex of G a list of possible colors. We wish to find a coloring of the vertices of G such that each vertex uses a color from its list and adjacent vertices are given different colors. In this thesis we study the problem of list coloring 1-planar graphs, i.e., graphs that can be drawn in the plane such that any edge intersects at most one other edge. We also study the closely related problem of simultaneously list coloring the vertices and faces of a planar graph, known as coupled list coloring. We show that 1-planar bipartite graphs are list colorable whenever all lists are of size at least four, and further show that this coloring can be found in linear time. In pursuit of this result, we show that the previously known edge partition of a 1-planar graph into a planar graph and a forest can be found in linear time. A wheel graph consists of a cycle of vertices, all of which are adjacent to an additional center vertex. We show that wheel graphs are coupled list colorable when all lists are of size five or more and show that this coloring can be found in linear time. Possible extensions of this result to planar partial 3-trees are discussed. Finally, we discuss the complexity of list coloring 1-planar graphs, both in parameterized and unparameterized settings. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/17813 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.subject | Graph | en |
| dc.subject | Graph Theory | en |
| dc.subject | Coloring | en |
| dc.subject | Graph Coloring | en |
| dc.subject | List Coloring | en |
| dc.subject | Choosability | en |
| dc.subject | Planar | en |
| dc.subject | 1-Planar | en |
| dc.title | List Coloring Some Classes of 1-Planar Graphs | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | David R. Cheriton School of Computer Science | en |
| uws-etd.degree.discipline | Computer Science | en |
| uws-etd.degree.grantor | University of Waterloo | en |
| uws-etd.embargo.terms | 0 | en |
| uws.contributor.advisor | Biedl, Therese | |
| 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 |