O. S. Lo

activity

20172025

most citedFew hamiltonian cycles in graphs with one or two vertex degrees

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

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2023

Truncated degree DP-colourability of $K_{2, 4}$ -minor free graphs

On-Hei Solomon Lo, Cheng Wang, Huan Zhou +1

Assume $G$ is a graph and $k$ is a positive integer. Let $f$ from $V (G)$ to $N$ be defined as $f (v)$ is the minimum of $k$ and $d (v)$ . If $G$ is $f$ -DP-colourable (respectively, $…

math.CO2022★ 1 cited

Few hamiltonian cycles in graphs with one or two vertex degrees

Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo +2

We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct…

math.CO2021

On the spanning structure hierarchy of 3-connected planar graphs

On-Hei Solomon Lo

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph $K_{2}$ . $G$ is prism-hamiltonian if the prism over $G$ has a Hamilton cycle. A good even cactus is…

math.CO2021

Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators

On-Hei Solomon Lo, Jianguo Qian

Whitney proved in 1931 that every 4-connected planar triangulation is hamiltonian. Later in 1979, Hakimi, Schmeichel and Thomassen conjectured that every such triangulation on $n$ …

math.CO2020

Tight gaps in the cycle spectrum of 3-connected planar graphs

Qing Cui, On-Hei Solomon Lo

For any positive integer $k$ , define $f (k)$ (respectively, $f_{3} (k)$ ) to be the minimal integer $\geq k$ such that every 3-connected planar graph $G$ (respectively, 3-connected cubic…

math.CO2019

Find Subtrees of Specified Weight and Cycles of Specified Length in Linear Time