5 citations · 5 across the 6 of their papers we have counts for
8 papers · 1 filter
An 18-colour bound for locally irregular decompositions
Carla Negri Lintzmayer, Guilherme Oliveira Mota, Maycon Sambinelli +1
A graph is locally irregular if adjacent vertices have distinct degrees. A graph G is decomposable if its edge set can be decomposed into locally irregular graphs, and its locally…
Proper conflict-free 7-coloring of planar graphs
A. Jiménez, C. N. Lintzmayer, M. Sambinelli
A proper conflict-free coloring is a proper vertex coloring in which every nonisolated vertex has a color occurring uniquely in its open neighborhood. We prove that every graph wit…
Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
Fábio Botler, Cristina G. Fernandes, Carla N. Lintzmayer +4
An immersion of a graph in a graph is a minimal subgraph of for which there is an injection and a set of edge-disjoint paths $\{P_e:…
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…
Gallai's path decomposition conjecture for triangle-free planar graphs
Fábio Botler, Andrea Jiménez, Maycon Sambinelli
A path decomposition of a graph is a collection of edge-disjoint paths of that covers the edge set of . Gallai (1968) conjectured that every connected graph on verti…