Essays about: "Graph Coloring"
Showing result 6 - 10 of 14 essays containing the words Graph Coloring.
-
6. One-sided interval edge-colorings of bipartite graphs
University essay from Linköpings universitet/Matematik och tillämpad matematik; Linköpings universitet/Tekniska fakultetenAbstract : A graph is an ordered pair composed by a set of vertices and a set of edges, the latter consisting of unordered pairs of vertices. Two vertices in such a pair are each others neighbors. Two edges are adjacent if they share a common vertex. Denote the amount of edges that share a specific vertex as the degree of the vertex. READ MORE
-
7. Avoiding edge colorings of hypercubes
University essay from Linköpings universitet/Matematik och tillämpad matematikAbstract : The hypercube Qn is the graph whose vertices are the ordered n-tuples of zeros and ones, where two vertices are adjacent iff they differ in exactly one coordinate. A partial edge coloring f of a graph G is a mapping from a subset of edges of G to a set of colors; it is called proper if no pair of adjacent edges share the same color. READ MORE
-
8. On the list coloring of k-band buffering cellular graphs
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The optimal channel allocation problem in cellular networks is often formulated in a graph theoretic framework. One of its variants–where each access point knows the list of its free channels–is related the so-called list coloring problem and is closely related to the channel allocation of IEEE 802.11 systems. READ MORE
-
9. Effects of Different Worker Heuristics in Marriage in Honey Bees Optimization : As Applied to the Graph Coloring Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Marriage in Honey Bees Optimization (MBO) is an interesting meta-heuristic inspired by the mating process of honey bees, where worker bees are collectively responsible for raising the next generation of the colony. In MBO, worker bees are represented by heuristics that are used to navigate the search space. READ MORE
-
10. On Minimal Non-(2, 1)-Colorable Graphs
University essay from Stockholms universitet/Matematiska institutionenAbstract : A graph is (2, 1)-colorable if it allows a partition of its vertices into two classes such that both induce graphs with maximum degree at most one. A non-(2, 1)-colorable graph is minimal if all proper subgraphs are (2, 1)-colorable. We prove that such graphs are 2-edge-connected and that every edge sits in an odd cycle. READ MORE
