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 2017Show all

3 papers · 1 filter

math.CO2017

Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for locally in-semicomplete digraphs

Maycon Sambinelli, Carla Negri Lintzmayer, Cândida Nunes da Silva +1

Let $k$ be a positive integer and let $D$ be a digraph. A path partition $\sP$ of $D$ is a set of vertex-disjoint paths which covers $V (D)$ . Its $k$ -norm is defined as $\sum_{P \in…

math.CO2017

Edge-magic labelings for constellations and armies of caterpillars

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

Let $G = (V, E)$ be an $n$ -vertex graph with $m$ edges. A function $f : V \cup E \to {1, \dots, n + m}$ is an edge-magic labeling of $G$ if $f$ is bijective and, for some int…

math.CO2017★ 5 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 $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$ . Gallai (1966) conjectured that every graph…