5 citations · 5 across the 2 of their papers we have counts for
4 papers
Towards Gallai's path decomposition conjecture
Fabio Botler, Maycon Sambinelli
A path decomposition of a graph G is a collection of edge-disjoint paths of G that covers the edge set of G. Gallai (1968) conjectured that every connected graph on n vertices admi…
Perfect digraphs
Cândida Nunes da Silva, Orlando Lee, Maycon Sambinelli
Let be a digraph. Given a set of vertices , an -path partition of is a collection of paths of such that $\{V(P) \colon P \in \mathcal…
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…
On Linial's Conjecture for Spine Digraphs
Maycon Sambinelli, Cândida Nunes da Silva, Orlando Lee
In this paper we introduce a superclass of split digraphs, which we call spine digraphs. Those are the digraphs D whose vertex set can be partitioned into two sets X and Y such tha…