5 citations · 14 across the 10 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
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…
math.CO2019
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…
math.CO2019★ 4 cited
Decomposing split graphs into locally irregular graphs
Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli
A graph is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph is a decomposition of such t…