Sökning: "Latin squares"

Hittade 4 avhandlingar innehållade orden Latin squares.

  1. 1. How to do what you want to do when you can not do what you want : on avoiding and completing partial latin squares

    Författare :Lars-Daniel Öhman; Roland Häggkvist; Tristan M. J. Denley; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Latin squares; constraint satisfaction; schedulling; array; ; MATHEMATICS; MATEMATIK;

    Sammanfattning : .... LÄS MER

  3. 2. On Latin squares and avoidable arrays

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

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

  4. 3. Enumerative approaches and structural results for selected combinatorial problems

    Författare :Denys Shcherbak; Gerold Jäger; Lars-Daniel Öhman; Lam Clement; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Graph; zero forcing; Latin squares; Youden squares; designs;

    Sammanfattning : .... LÄS MER

  5. 4. Edge Precoloring Extension of Trees

    Författare :Fikre Bogale Petros; Carl Johan Casselgren; Armen Asratian; Lars-Daniel Öhman; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Given a set of k colors and a graph G with a subset S of precolored edges (a partial k-edge coloring of G), we consider the problem of determining whether G has a proper edge coloring of G with the same k colors (an extension of the partial coloring) where the colors of edges in S are not changed. If such a coloring exists, then the partial k-coloring is called extendable. LÄS MER