Sökning: "Armen Asratian"

Hittade 3 avhandlingar innehållade orden Armen Asratian.

  1. 1. Local Conditions for Long Cycles in Graphs

    Författare :Jonas B. Granholm; Carl Johan Casselgren; Armen Asratian; Jørgen Bang-Jensen; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : 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 both for Hamiltonicity and for other, related properties. LÄS MER

  2. 2. Local Conditions for Cycles in Graphs

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

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

  3. 3. 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