Sökning: "Lars-Daniel Öhman"
Hittade 4 avhandlingar innehållade orden Lars-Daniel Öhman.
1. How to do what you want to do when you can not do what you want : on avoiding and completing partial latin squares
Sammanfattning : .... LÄS MER
2. Edge Precoloring Extension of Trees
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
3. Enumerative approaches and structural results for selected combinatorial problems
Sammanfattning : .... LÄS MER
4. On Latin squares and avoidable arrays
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