Homomorphism Reconfiguration via Homotopy

2020 
For a fixed graph H, we consider the H-Recoloring problem: given a graph G and two H-colorings of G, i.e., homomorphisms from G to H, can one be transformed into the other by changing one color at ...
    • Correction
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []