Abstract
dc:description.abstract<p>We consider two branches of coloring problems for graphs: list coloring and packing coloring. We introduce a new variation to list coloring which we call choosability with union separation: For a graph G, a list assignment L to the vertices of G is a (k,k+t)-list assignment if every vertex is assigned a list of size at least k and the union of the lists of each pair of adjacent vertices is at least k+t. We explore this new variation and offer comparative results to choosability with intersection separation, a variation that has been studied previously.</p> <p>Regarding packing colorings, we consider infinite lattice graphs and provide bounds to their packing chromatic numbers. We also provide algorithms for coloring these graphs. The lattices we color include two-layer hexagonal lattices as well as the truncated square lattice, a 3-regular lattice whose faces have length 4 and 8.</p>
Degree
thesis:*- Name thesis:degree_name
- Doctor of Philosophy
- Level thesis:degree_level
- dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Department dc:contributor.department
- Department of Mathematics
- Year dc:date.issued
- 2017
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Moss, Kevin
- Advisors dc:contributor.advisor
-
- Berard Lidicky
- Steve Butler
Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Identifier
- archive/lib.dr.iastate.edu/etd/15383/
- OAI identifier oai:identifier
- oai:dr.lib.iastate.edu:20.500.12876/29566