Search for dissertations about: "Carl Johan Casselgren"

Found 4 swedish dissertations containing the words Carl Johan Casselgren.

  1. 1. On some graph coloring problems

    Author : Carl Johan Casselgren; Roland Häggkvist; Svante Linusson; Umeå universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; List coloring; interval edge coloring; coloring graphs from random lists; biregular graph; avoiding arrays; Latin square; scheduling; Discrete mathematics; Diskret matematik; Mathematics; matematik;

    Abstract : .... READ MORE

  2. 2. Local Conditions for Cycles in Graphs

    Author : Jonas Granholm; Armen Asratian; Carl Johan Casselgren; Victor Falgas Ravry; Linköpings universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is called Hamiltonian if it contains such a cycle. The problem of determining if a graph is Hamiltonian has been studied extensively, and there are many known sufficient conditions for Hamiltonicity. READ MORE

  3. 3. On avoiding and completing colorings

    Author : Lan Anh Pham; Klas Markström; Carl Johan Casselgren; Victor Falgas-Ravry; Roland Häggkvist; Kimmo Eriksson; Umeå universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Graph coloring; precoloring; list assignment;

    Abstract : All of my papers are related to the problem of avoiding and completing an edge precoloring of a graph. In more detail, given a graph G and a partial proper edge precoloring φ of G and a list assignment L for every non-colored edge of G, can we extend φ to a proper edge coloring of G which avoids L? In Paper I, G is the d-dimensional hypercube graph Qd, a partial proper edge precoloring φ and a list assignment L must satisfy certain sparsity conditions. READ MORE

  4. 4. On Latin squares and avoidable arrays

    Author : Lina J. Andrén; Roland Häggkvist; Kimmo Eriksson; Umeå universitet; []
    Keywords : NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Latin square; avoidability; avoidable array; Discrete mathematics; Diskret matematik; Mathematics; matematik;

    Abstract : This thesis consists of the four papers listed below and a survey of the research area. I Lina J. Andrén: Avoiding (m, m, m)-arrays of order n = 2k II Lina J. Andrén: Avoidability of random arrays III Lina J. READ MORE