3 citations · 5 across the 10 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 3 cited
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs
Ruonan Li, Hajo Broersma, Shenggui Zhang
It is conjectured that every edge-colored complete graph on vertices satisfying contains vertex-disjoint properly edge-colored cycles. We confir…
cs.ET2017★ 2 cited
Computability and Complexity of Unconventional Computing Devices
Hajo Broersma, Susan Stepney, Goran Wendin
We discuss some claims that certain UCOMP devices can perform hypercomputation (compute Turing-uncomputable functions) or perform super-Turing computation (solve NP-complete proble…