1 citations · 4 across the 11 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Connectivity keeping paths in digraphs
Hojin Chu, Boram Park, Homoon Ryu
Mader conjectured that every -strong digraph with minimum semidegree contains a dipath of order such that remains -strong. For ,…
math.CO2026
On 2-connected graphs without cycles of length 1 modulo 3
Yandong Bai, Hojin Chu, Binlong Li +2
Burr and Erdős conjectured in 1976 that for all integers such that contains an even integer, every -vertex graph without cycles of length $\ell…