5 citations · 14 across the 10 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for locally in-semicomplete digraphs
Maycon Sambinelli, Carla Negri Lintzmayer, Cândida Nunes da Silva +1
Let be a positive integer and let be a digraph. A path partition $\sP$ of is a set of vertex-disjoint paths which covers . Its -norm is defined as $\sum_{P \in…
math.CO2017★ 5 cited
On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3
Fábio Botler, Maycon Sambinelli, Rafael S. Coelho +1
A path (resp. cycle) decomposition of a graph is a set of edge-disjoint paths (resp. cycles) of that covers the edge set of . Gallai (1966) conjectured that every graph…