3 citations · 5 across the 4 of their papers we have counts for
4 papers
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…
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…
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Hajo Broersma, Jiří Fiala, Petr A. Golovach +3
Hung and Chang showed that for all k>=1 an interval graph has a path cover of size at most k if and only if its scattering number is at most k. They also showed that an interval gr…
Complexity of the conditional colorability of graphs
Xueliang Li, Xiangmei Yao, Wenli Zhou
For an integer , a conditional -coloring of a graph is a proper -coloring of the vertices of such that every vertex of degree in is adjacent t…