Thesis (Ph.D.) -- University of Rhode Island, 2007 / Typescript. Includes bibliographical references (leaves 80-83).

Thesis (Master)--İzmir Institute of Technology, İzmir, 2004. / Includes bibliographical references (leaves. 38-39).

Thesis (Master)--İzmir Institute of Technology, İzmir, 2004. / Includes bibliographical references (leaves. 35-36).

Thesis (M.A.)--The University of North Carolina at Greensboro, 2008. / Directed by Paul Duvall; submitted to the Dept. of Mathematical Sciences. Title from PDF t.p. (viewed Aug. 26, 2009). Includes bibliographical references (p. 38).

Thesis (Ph. D.)--University of Wisconsin--Madison, 1975. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.

abstract: Graph coloring is about allocating resources that can be shared except where there are certain pairwise conflicts between recipients. The simplest coloring algorithm that attempts to conserve resources is called first fit. Interval graphs are used in models for scheduling (in computer science and operations research) and in biochemistry for one-dimensional molecules such as genetic material. It is not known precisely how much waste in the worst case is due to the first-fit algorithm for coloring interval graphs. However, after decades of research the range is narrow. Kierstead proved that the performance ratio R is at most 40. Pemmaraju, Raman, and Varadarajan proved that R is at most 10. This can be improved to 8. Witsenhausen, and independently Chrobak and Slusarek, proved that R is at least 4. Slusarek improved this to 4.45. Kierstead and Trotter extended the method of Chrobak and Slusarek to one good for a lower bound of 4.99999 or so. The method relies on number sequences with a certain property of order. It is shown here that each sequence considered in the construction satisfies a linear recurrence; that R is at least 5; that the Fibonacci sequence is in some sense minimally useless for the construction; and that the Fibonacci sequence is a point of accumulation in some space for the useful sequences of the construction. Limitations of all earlier constructions are revealed. / Dissertation/Thesis / Ph.D. Mathematics 2010

Title: Algebraic Structures for Knot Coloring Author: Martina Vaváčková Department: Department of Algebra Supervisor: doc. RNDr. David Stanovský, Ph.D., Department of Algebra Abstract: This thesis is devoted to the study of the algebraic structures providing coloring invariants for knots and links. The main focus is on the relationship between these invariants. First of all, we characterize the binary algebras for arc and semiarc coloring. We give an example that the quandle coloring invariant is strictly stronger than the involutory quandle coloring invariant, and we show the connection between the two definitions of a biquandle, arising from different approaches to semiarc coloring. We use the relationship between links and braids to conclude that quandles and biquandles yield the same coloring invariants. Keywords: knot, coloring invariant, quandle, biquandle iii

The target of this thesis was to obtain a sufficient number of DNA samples from individuals Breed Large Münsterländer and they perform genotyping newly described mutation c.555> G in exon 2 of the gene TYRP1. In the case of this mutation in the breed we studied, another aim of the work was to propose breeding measures that would limit the spread of this undesirable mutation. At the beginning of the literary overview, the breed of the great Münsterlander, his history, the breed, the standard with an emphasis on the permitted coloring and the current breeding of a large Mässlandlander in the Czech Republic. The thesis describes the individual genetic foundations of coloring and explains the principles of the methods used in their own work. In its own work genotyping was performed on the mutation in exon 2 of the TYRP1 gene by polymerase chain reaction and sequencing methods. This mutation was not demonstrated in either of the 113 tested individuals of the Greater Münsterlander. It was also used of the available commercial tests previously described mutations in the gene TYRP1 on which were worked out plans for auxiliary mating as an aid to farmers to avoid the herd to increase the number of recessive homozygotes undesirable brown coat color or heterozygotes, who carry a mutated allele.

abstract: The current study investigated the task of coloring static images with multimedia learning to determine the impact on retention and transfer scores. After watching a multimedia video on the formation of lightning participants were assigned to either a passive, active, or constructive condition based on the ICAP Framework. Participants colored static images on key concepts from the video, passive condition observed the images, active condition colored the images by applying the concepts, and the constructive condition colored the images by generating new ideas and concepts. The study did not support the hypothesis that the constructive condition would have increased retention and transfer scores over the active and passive conditions. The mental effort measures did not show significance among groups in relation to learning but perception measures did show an increase in participants enjoyment and engagement. Since the coloring craze has become more accepted for adults then could coloring be a way to increase participants learning through engagement. / Dissertation/Thesis / Masters Thesis Human Systems Engineering 2018

abstract: Every graph can be colored with one more color than its maximum degree. A well-known theorem of Brooks gives the precise conditions under which a graph can be colored with maximum degree colors. It is natural to ask for the required conditions on a graph to color with one less color than the maximum degree; in 1977 Borodin and Kostochka conjectured a solution for graphs with maximum degree at least 9: as long as the graph doesn't contain a maximum-degree-sized clique, it can be colored with one fewer than the maximum degree colors. This study attacks the conjecture on multiple fronts. The first technique is an extension of a vertex shuffling procedure of Catlin and is used to prove the conjecture for graphs with edgeless high vertex subgraphs. This general approach also bears more theoretical fruit. The second technique is an extension of a method Kostochka used to reduce the Borodin-Kostochka conjecture to the maximum degree 9 case. Results on the existence of independent transversals are used to find an independent set intersecting every maximum clique in a graph. The third technique uses list coloring results to exclude induced subgraphs in a counterexample to the conjecture. The classification of such excludable graphs that decompose as the join of two graphs is the backbone of many of the results presented here. The fourth technique uses the structure theorem for quasi-line graphs of Chudnovsky and Seymour in concert with the third technique to prove the Borodin-Kostochka conjecture for claw-free graphs. The fifth technique adds edges to proper induced subgraphs of a minimum counterexample to gain control over the colorings produced by minimality. The sixth technique adapts a recoloring technique originally developed for strong coloring by Haxell and by Aharoni, Berger and Ziv to general coloring. Using this recoloring technique, the Borodin-Kostochka conjectured is proved for graphs where every vertex is in a large clique. The final technique is naive probabilistic coloring as employed by Reed in the proof of the Borodin-Kostochka conjecture for large maximum degree. The technique is adapted to prove the Borodin-Kostochka conjecture for list coloring for large maximum degree. / Dissertation/Thesis / Ph.D. Mathematics 2013