1 citations · 2 across the 8 of their papers we have counts for
11 papers
Period matrices and homological quasi-trees on discrete Riemann surfaces
Wai Yeung Lam, On-Hei Solomon Lo, Chi Ho Yuen
We study discrete period matrices associated with graphs cellularly embedded on closed surfaces, resembling classical period matrices of Riemann surfaces. Defined via integrals of…
Truncated degree DP-colourability of -minor free graphs
On-Hei Solomon Lo, Cheng Wang, Huan Zhou +1
Assume is a graph and is a positive integer. Let from to be defined as is the minimum of and . If is -DP-colourable (respectively, $…
Defective acyclic colorings of planar graphs
On-Hei Solomon Lo, Ben Seamone, Xuding Zhu
This paper studies two variants of defective acyclic coloring of planar graphs. For a graph and a coloring of , a 2CC transversal is a subset of that interse…
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…
Counting cycles in planar triangulations
On-Hei Solomon Lo, Carol T. Zamfirescu
We investigate the minimum number of cycles of specified lengths in planar -vertex triangulations . It is proven that this number is for any cycle length at most $3 +…
On the spanning structure hierarchy of 3-connected planar graphs
On-Hei Solomon Lo
The prism over a graph is the Cartesian product of with the complete graph . is prism-hamiltonian if the prism over has a Hamilton cycle. A good even cactus is…
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 …
Tight gaps in the cycle spectrum of 3-connected planar graphs
Qing Cui, On-Hei Solomon Lo
For any positive integer , define (respectively, ) to be the minimal integer such that every 3-connected planar graph (respectively, 3-connected cubic…
Find Subtrees of Specified Weight and Cycles of Specified Length in Linear Time
On-Hei Solomon Lo
We apply the Euler tour technique to find subtrees of specified weight as follows. Let such that , and $2k - 4g - h +…
Compact Cactus Representations of all Non-Trivial Min-Cuts
On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup
Recently, Kawarabayashi and Thorup presented the first deterministic edge-connectivity recognition algorithm in near-linear time. A crucial step in their algorithm uses the existen…
Cut Tree Structures with Applications on Contraction-Based Sparsification
On-Hei Solomon Lo, Jens M. Schmidt
We introduce three new cut tree structures of graphs in which the vertex set of the tree is a partition of and contractions of tree vertices satisfy sparsification requi…