Submitted
Published
[4] Hyobeen Kim, M Siggers* : The complexity of adaptably k-colouring edge-coloured hypergraphs, Kyungpook Mathematical Journal 65 (2), 195-206
[3] Hyobeen Kim, J Lee, M Siggers* : Mixing is hard for triangle-free reflexive graphs, European Journal of Combinatorics 116, 103860
[2] C Heo, Hyobeen Kim*, M Siggers : The complexity of the matroid homomorphism problem, The Electronic Journal of Combinatorics, P2. 28-P2. 28
[1] Hyobeen Kim, M Siggers* : Towards A Dichotomy for the List Switch Homomorphism Problem for Signed Graphs, Kyungpook Mathematical Journal 63 (3), 355-372