Browsing Mathematics (Faculty of) by Subject "Graph Coloring"
Now showing items 1-4 of 4
-
Applied Hilbert's Nullstellensatz for Combinatorial Problems
(University of Waterloo, 2016-09-23)Various feasibility problems in Combinatorial Optimization can be stated using systems of polynomial equations. Determining the existence of a \textit{stable set} of a given size, finding the \textit{chromatic number} of ... -
Extensions of Galvin's Theorem
(University of Waterloo, 2018-04-30)We discuss problems in list coloring with an emphasis on techniques that utilize oriented graphs. Our central theme is Galvin's resolution of the Dinitz problem (Galvin. J. Comb. Theory, Ser. B 63(1), 1995, 153--158). We ... -
Intersperse Coloring
(University of Waterloo, 2007-09-27)In this thesis, we introduce the intersperse coloring problem, which is a generalized version of the hypergraph coloring problem. In the intersperse coloring problem, we seek a coloring that assigns at least l different ... -
List Coloring Some Classes of 1-Planar Graphs
(University of Waterloo, 2021-12-23)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 ...