Blar i Bergen Open Research Archive på forfatter "Crespelle, Christophe Dominique"

Viser treff 1-3 av 3

    • Cyclability in Graph Classes 

      Crespelle, Christophe Dominique; Feghali, Carl; Golovach, Petr (Peer reviewed; Journal article, 2019)
      A subset T subseteq V(G) of vertices of a graph G is said to be cyclable if G has a cycle C containing every vertex of T, and for a positive integer k, a graph G is k-cyclable if every subset of vertices of G of size at ...

    • Cyclability in graph classes 

      Crespelle, Christophe Dominique; Golovach, Petr (Journal article; Peer reviewed, 2022)
      A subset T ⊆ V(G) of vertices of a graph G is said to be cyclable if G has a cycle C containing every vertex of T, and for a positive integer k, a graph G is k-cyclable if every set of vertices of size at most k is cyclable. ...

    • On the effectiveness of the incremental approach to minimal chordal edge modification 

      Blair, Jean; Crespelle, Christophe Dominique (Journal article; Peer reviewed, 2021)
      Because edge modification problems are computationally difficult for most target graph classes, considerable attention has been devoted to inclusion-minimal edge modifications, which are usually polynomial-time computable ...