On‐Hei Solomon Lo

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat Defective acyclic colorings of planar graphs 2024 On‐Hei Solomon Lo
Ben Seamone
Xuding Zhu
+ PDF Chat Few hamiltonian cycles in graphs with one or two vertex degrees 2024 Jan Goedgebeur
Jorik Jooken
On‐Hei Solomon Lo
Ben Seamone
Carol T. Zamfirescu
+ Defective acyclic colorings of planar graphs 2023 On‐Hei Solomon Lo
Ben Seamone
Xuding Zhu
+ DP-$5$-truncated-degree-colourability of $K_{2,4}$-minor free graphs 2023 On‐Hei Solomon Lo
Cheng Wang
Huan‐Xiang Zhou
Xuding Zhu
+ Distribution of subtree sums 2022 On‐Hei Solomon Lo
+ Tight cycle spectrum gaps of cubic 3-connected toroidal graphs 2022 On‐Hei Solomon Lo
Carol T. Zamfirescu
+ PDF Chat Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators 2022 On‐Hei Solomon Lo
Jianguo Qian
+ Counting cycles in planar triangulations 2022 On‐Hei Solomon Lo
Carol T. Zamfirescu
+ Few hamiltonian cycles in graphs with one or two vertex degrees 2022 Jan Goedgebeur
Jorik Jooken
On‐Hei Solomon Lo
Ben Seamone
Carol T. Zamfirescu
+ PDF Chat Find subtrees of specified weight and cycles of specified length in linear time 2021 On‐Hei Solomon Lo
+ On the spanning structure hierarchy of 3-connected planar graphs 2021 On‐Hei Solomon Lo
+ PDF Chat Tight Gaps in the Cycle Spectrum of 3-Connected Planar Graphs 2021 Qing Cui
On‐Hei Solomon Lo
+ Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators 2021 On‐Hei Solomon Lo
Jianguo Qian
+ Tight gaps in the cycle spectrum of 3-connected cubic planar graphs. 2020 Qing Cui
On‐Hei Solomon Lo
+ PDF Chat Compact cactus representations of all non-trivial min-cuts 2020 On‐Hei Solomon Lo
Jens M. Schmidt
Mikkel Thorup
+ PDF Chat Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs 2020 On‐Hei Solomon Lo
Jens M. Schmidt
Nico Van Cleemput
Carol T. Zamfirescu
+ Tight gaps in the cycle spectrum of 3-connected planar graphs 2020 Qing Cui
On‐Hei Solomon Lo
+ Subtrees search, cycle spectra and edge-connectivity structures 2019 On‐Hei Solomon Lo
+ Find Subtrees of Specified Weight and Cycles of Specified Length in Linear Time 2019 On‐Hei Solomon Lo
+ Find Subtrees of Specified Weight and Cycles of Specified Length in Linear Time 2019 On‐Hei Solomon Lo
+ Compact Cactus Representations of all Non-Trivial Min-Cuts 2018 On‐Hei Solomon Lo
Jens M. Schmidt
Mikkel Thorup
+ Compact Cactus Representations of all Non-Trivial Min-Cuts 2018 On‐Hei Solomon Lo
Jens M. Schmidt
Mikkel Thorup
+ Cut Tree Structures with Applications on Contraction-Based Sparsification 2017 On‐Hei Solomon Lo
Jens M. Schmidt
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Gaps in the cycle spectrum of 3-connected cubic planar graphs 2020 Martin Merker
3
+ PDF Chat Finding and counting given length cycles 1997 Noga Alon
Raphael Yuster
Uri Zwick
2
+ Finding large cycles in Hamiltonian graphs 2010 Tomás Feder
Rajeev Motwani
2
+ Counterexamples to a conjecture of Merker on 3-connected cubic planar graphs with a large cycle spectrum gap 2020 Carol T. Zamfirescu
2
+ Cycle lengths in polytopal graphs 1978 Joseph Malkevitch
2
+ On Hamilton cycles in certain planar graphs 1996 Daniel P. Sanders
2
+ PDF Chat Deterministic Edge Connectivity in Near-Linear Time 2018 Ken‐ichi Kawarabayashi
Mikkel Thorup
2
+ A near-linear time algorithm for constructing a cactus representation of minimum cuts 2009 David R. Karger
Debmalya Panigrahi
2
+ On the lengths of cycles in planar graphs 1971 Joseph Malkevitch
2
+ The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph 1993 Mao-cheng Cai
1
+ Chords of Longest Cycles in Cubic Graphs 1997 Carsten Thomassen
1
+ Practical graph isomorphism, II 2013 Brendan D. McKay
Adolfo Piperno
1
+ Colorings of plane graphs: A survey 2012 O. V. Borodin
1
+ On Hamiltonian Circuits 1946 W. T. Tutte
1
+ PDF Chat Simple paths on convex polyhedra 1961 Tom Brown
1
+ Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs 1998 Carsten Thomassen
1
+ PDF Chat W v paths on the torus 1990 David Barnette
1
+ Polyhedral graphs without hamiltonian cycles 1997 Hansjoachim Walther
1
+ A characterization of Hamiltonian prisms 1993 P. Paulraja
1
+ Non-hamiltonian cubic planar maps 1974 G.B. Faulkner
D. H. Younger
1
+ On paths in planar graphs 1997 Daniel P. Sanders
1
+ Reflections on graph theory 1986 Carsten Thomassen
1
+ On hamiltonian cycles in the prism over the odd graphs 2010 Letícia Rodrigues Bueno
Peter Horák
1
+ PDF Chat Simple paths on polyhedra 1963 J. W. Moon
Leo Moser
1
+ Spanning cycles of nearly cubic graphs 1980 R. C. Entringer
Henda C. Swart
1
+ A degree sum condition for graphs to be prism hamiltonian 2009 Kenta Ozeki
1
+ Pairs of edge-disjoint Hamiltonian circuits 1975 Branko Grünbaum
Joseph Malkevitch
1
+ On the number of cycles of length <i>k</i> in a maximal planar graph 1979 S. L. Hakimi
E. F. Schmeichel
1
+ PDF Chat Polytopes, graphs, and complexes 1970 Branko Grünbaum
1
+ PDF Chat Flip-Flops in Hypohamiltonian Graphs 1973 Vašek Chvátal
1
+ PDF Chat Longest Cycles in 3-Connected 3-Regular Graphs 1980 J. A. Bondy
Miklós Simonovits
1
+ PDF Chat Trees in Polyhedral Graphs 1966 David Barnette
1
+ PDF Chat On the Minimum Number of Hamiltonian Cycles in Regular Graphs 2017 Michael Haythorpe
1
+ Tudor Zamfirescu: From Convex to Magic 2016 Solomon Marcus
1
+ On the number of hamiltonian cycles in triangulations with few separating triangles 2017 Gunnar Brinkmann
Jasper Souffriau
Nico Van Cleemput
1
+ PDF Chat Some new results about the shortness exponent in polyhedral graphs 1987 Jochen Harant
Hansjoachim Walther
1
+ Planar graphs, regular graphs, bipartite graphs and Hamiltonicity. 1999 Derek Holton
R. E. L. Aldred
1
+ PDF Chat Polyhedra with Few 3-Cuts are Hamiltonian 2019 Gunnar Brinkmann
Carol T. Zamfirescu
1
+ Graphs with few hamiltonian cycles 2019 Jan Goedgebeur
Barbara Meersman
Carol T. Zamfirescu
1
+ Cycles in 5-connected triangulations 2019 Adel Alahmadi
R. E. L. Aldred
Carsten Thomassen
1
+ Local Flow Partitioning for Faster Edge Connectivity 2017 Monika Henzinger
Satish Rao
Di Wang
1
+ PDF Chat Circumference of 3-connected cubic graphs 2017 Qinghai Liu
Xingxing Yu
Zhao Zhang
1
+ PDF Chat Long cycles in Hamiltonian graphs 2018 António Girão
Teeradej Kittipassorn
Bhargav Narayanan
1
+ PDF Chat On Snarks that are far from being 3-Edge Colorable 2016 Jonas Hägglund
1
+ The Chvátal–Erdős condition for prism-Hamiltonicity 2019 M. N. Ellingham
Pouria Salehi Nowbandegani
1
+ Toughness and prism-hamiltonicity of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e20" altimg="si14.svg"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs 2020 M. N. Ellingham
Pouria Salehi Nowbandegani
Songling Shan
1
+ PDF Chat A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs 2020 Jorik Jooken
Pieter Leyman
Patrick De Causmaecker
1
+ A counterexample to prism-hamiltonicity of 3-connected planar graphs 2020 Simon Špacapan
1
+ PDF Chat Long cycles and spanning subgraphs of locally maximal 1‐planar graphs 2020 Igor Fabrici
Jochen Harant
Tomáš Madaras
Samuel Mohr
Roman Soták
Carol T. Zamfirescu
1
+ Minimal unavoidable sets of cycles in plane graphs with restricted minimum degree and edge weight. 2019 Tomáš Madaras
Martina Tamášová
1