Sökning: "edge coloring"

Visar resultat 1 - 5 av 7 uppsatser innehållade orden edge coloring.

  1. 1. Upper bounds for the star chromatic index of multipartite graphs

    Kandidat-uppsats, Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Gabriel Sparrman; [2022]
    Nyckelord :Graph; Graph theory; Multipartite Graph; Graph Coloring; Star edge coloring; Star chromatic index;

    Sammanfattning : A star edge coloring is any edge coloring which is both proper and contains no cycles or path of length four which are bicolored, and the star chromatic index of a graph is the smallest number of colors for which that graph can be star edge colored. Star edge coloring is a relatively new field in graph theory, and very little is known regarding upper bounds of the star chromatic index of most graph types, one of these families being multipartite graphs. LÄS MER

  3. 2. One-sided interval edge-colorings of bipartite graphs

    Kandidat-uppsats, Linköpings universitet/Matematik och tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Författare :Jonatan Renman; [2020]
    Nyckelord :interval edge coloring; edge coloring; bipartite graph;

    Sammanfattning : 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. LÄS MER

  4. 3. Avoiding edge colorings of hypercubes

    Kandidat-uppsats, Linköpings universitet/Matematik och tillämpad matematik

    Författare :Per Johansson; [2019]
    Nyckelord :Graph Theory; Hypercubes; Avoiding edge colorings;

    Sammanfattning : 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. LÄS MER

  5. 4. On Minimal Non-(2, 1)-Colorable Graphs

    Master-uppsats, Stockholms universitet/Matematiska institutionen

    Författare :Ruth Bosse; [2017]
    Nyckelord :Graph coloring;

    Sammanfattning : 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. LÄS MER

  7. 5. Smart cykelförvaring på pendelbåt

    Kandidat-uppsats, KTH/Maskinkonstruktion (Inst.)

    Författare :Sebastian Korling; Emil Sollenby; [2014]
    Nyckelord :;

    Sammanfattning : SjöVägen är SLs enda nuvarande pendelbåtslinje, linje 80, och har varit i drift sedan 2012. Den sträcker sig från Nybroplan till Frihamnen via bland annat Nacka och Lidingö. Linjen är en av få i Stockholms kollektivtrafik som tillåter att resenärer tar med sig sin cykel ombord. LÄS MER