Orlando Lee

activity

20132022

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

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

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019

Two novel results on the existence of $3$ -kernels in digraphs

Alonso Ali, Orlando Lee

Let $D$ be a digraph. We call a subset $N$ of $V (D)$ $k$ -independent if for every pair of vertices $u, v \in N$ , $d (u, v) \geq k$ ; and we call it $ℓ$ -absorbent if for every vertex…

math.CO2019

Perfect digraphs

Cândida Nunes da Silva, Orlando Lee, Maycon Sambinelli

Let $D$ be a digraph. Given a set of vertices $S \subseteq V (D)$ , an $S$ -path partition $P$ of $D$ is a collection of paths of $D$ such that $\{V(P) \colon P \in \mathcal…

math.CO2019★ 2 cited

Graphs with at most one crossing

André C. Silva, Alan Arroyo, R. Bruce Richter +1

The crossing number of a graph $G$ is the least number of crossings over all possible drawings of $G$ . We present a structural characterization of graphs with crossing number one.

Two novel results on the existence of 3-kernels in digraphs

Perfect digraphs

Graphs with at most one crossing

Two novel results on the existence of $3$ -kernels in digraphs