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 20 of 180 for “"coloring"”.
-
Coloring clique hypergraphs
… a set of k colors. A map c : V Sk is a proper k-coloring for CH(G) if any maximal clique of G with at least two vertices receives at least two distinct colors. Let W ⊂ V, and let s ≥ 1. We say that G is (W, s)-extendible if any assignment on W with at most s colors can be extended to a …
-
Coloring with defects
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.
-
Dynamic coloring of graphs
… we introduce and study the idea of a dynamic coloring of a graph, a coloring in which any multiple-degree vertex of the graph must be adjacent to at least two color classes.;As parts of the overall research, we study (for some interesting subjects of colorings) the corresponding subjects of …
-
Coloring time with CodaChrome
As new computationally enhanced tools become available, there is an opportunity to give more and more people access to new ways for personal, creative expression. We designed a new computational construction kit to allow children and adults to design and build interactive, dynamic color patterns on …
-
Edge coloring of simple graphs and edge -face coloring of simple plane graphs
… a simple plane graph G, an edge-face k-coloring of G is a function &phis; : E(G) ∪ F(G) {lcub}1, ···, k{rcub} such that, for any two adjacent elements a, b ∈ E(G) ∪ F(G), &phis;( a) ≠ &phis;(b). Denote chie( G), chief(G), Delta( G) the edge chromatic …
-
Coloring problems in graph theory
<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 …
-
List coloring in general graphs
… relatively new approaches to the problem of list-coloring graphs. This is a problem that has its roots in classical graph theory, but has developed an entire theory of its own, that uses tools from structural graph theory, probabilistic approaches, as well as heuristic and algorithmic approaches. …
-
Network Application Classification Using Motif Coloring
As the pervasiveness of computer networks continues to grow, network
-
From Graph Coloring to Receptor Clustering
1. Hued colorings for planar graphs, graphs of higher genus and K4-minor free graphs.;For integers k, r > 0, a (k,r) -coloring of a graph G is a proper coloring of the vertices of G with k colors such that every vertex v of degree d(v) is adjacent to vertices with at least min{lcub}d(v) ,r{rcub} …
-
Coloring matter in camillia japonica flowers
<p>The coloring matter in flowers has been used for centuries as a dye. Early man did not know the chemical nature of these coloring matters. Recent investigations have shown that the dark pigments whereas the lighter pigments of flowers are in the anthoxanthin group of pigments. Both of these …
-
Graph coloring algorithms on random graphs
<p>"The graph coloring problem, which is to color the vertices of a simple undirected graph with the minimum number of colors such that no adjacent vertices are assigned the same color, arises in a variety of scheduling problems. This dissertation focuses attention on vertex sequential coloring. …
-
Coloring Problems on Graphs and Hypergraphs
An r-edge-coloring of Kn is (r, m)-splittable if V (Kn) can then be r-colored to avoid totally monochromatic m-cliques (introduced by Erdo&huml;s and Gyarfas. We interpret such colorings using a two-round game against an adversary; this relates splittable colorings to classical Ramsey numbers. Let …
-
Coloring and Labeling Problems on Graphs
Made available in DSpace on 2015-09-25T20:20:20Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3269869.pdf: 3445195 bytes, checksum: 26b8fe986beac04ee8236ca22105d8c5 (MD5) Previous issue date: 2007
-
Coloring and covering problems on graphs
… A \emph{star $k$-coloring} is a proper $k$-coloring where the union of any two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-colorable. One method to produce a star 4-coloring is to partition the …
-
A probabilistic perspective on graph coloring
Graph coloring is perhaps the most fundamental, deeply-studied, and well-known area in graph theory, with many of the most basic questions in the field still widely open. Graph coloring questions often have wide ranging applications across fields as diverse as statistical physics, theoretical …
Page 1 of 9