Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Minimal Coloring"”.
-
Effects of n>m Clos networks on edge coloring and matrix decomposition algorithms
… in this thesis are n > m Clos networks on edge coloring and matrix decomposition algorithms. This work uses a two-fold approach to examine the effects of n > m Clos networks on edge coloring and matrix decomposition algorithms. First, edge coloring and matching on bipartite multigraphs are …
-
On the Number of Colors in Quandle Knot Colorings
… is colorability. In this thesis, we study Fox colorings of knots and knots that are colored by linear Alexander quandles. In recent years, there has been an interest in reducing Fox colorings to a minimum number of colors. We prove that any Fox coloring of a 13-colorable knot has a diagram that …