Browsing Bergen Open Research Archive by Author "Moura, Phablo F S"

Now showing items 1-2 of 2

    • Polyhedral approach to weighted connected matchings in general graphs 

      Samer, Phillippe; Moura, Phablo F S (Journal article; Peer reviewed, 2024)
      A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximum cardinality is a well-solved problem, ...

    • Subdivisions in digraphs of large out-degree or large dichromatic number 

      Aboulker, Pierre; Cohen, Nathann; Havet, Frederic; Lochet, William; Moura, Phablo F S; Thomasse, Stephan (Journal article; Peer reviewed, 2019)
      In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-degree at least f ( k ) contains a subdivision of the transitive tournament of order k . This conjecture is still completely ...