activity
20162021
most citedOn Gallai's and Hajós' Conjectures for graphs with treewidth at most 3

5 citations · 9 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO20214 cited

Some results on structure of all arc-locally (out) in-semicomplete digraphs

Lucas I. B. Freitas, Orlando Lee

Arc-locally semicomplete and arc-locally in-semicomplete digraphs were introduced by Bang-Jensen as a common generalization of both semicomplete and semicomplete bipartite digraphs…

math.CO2019

Two novel results on the existence of -kernels in digraphs

Alonso Ali, Orlando Lee

Let be a digraph. We call a subset of -independent if for every pair of vertices , ; and we call it -absorbent if for every vertex…

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.CO2017

Edge-magic labelings for constellations and armies of caterpillars

Márcia R. Cerioli, Cristina G. Fernandes, Orlando Lee +3

Let be an -vertex graph with edges. A function is an edge-magic labeling of if is bijective and, for some int…

math.CO20175 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…

math.CO2016

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…