Homomorphism reconfiguration via homotopy
From MaRDI portal
Publication:2955037
DOI10.4230/LIPIcs.STACS.2015.730zbMath1356.68111arXiv1408.2812OpenAlexW3022807994MaRDI QIDQ2955037
Publication date: 24 January 2017
Full work available at URL: https://arxiv.org/abs/1408.2812
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of simplicial complexes (05E45)
Related Items (22)
A dichotomy theorem for circular colouring reconfiguration ⋮ Finding shortest paths between graph colourings ⋮ Parameterized complexity of the list coloring reconfiguration problem with graph parameters ⋮ Square-free graphs are multiplicative ⋮ Degree-Constrained Subgraph Reconfiguration is in P ⋮ Recoloring graphs via tree decompositions ⋮ Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ ⋮ Galactic token sliding ⋮ Mixing is hard for triangle-free reflexive graphs ⋮ Recolouring homomorphisms to triangle-free reflexive graphs ⋮ Unnamed Item ⋮ Four-cycle free graphs, height functions, the pivot property and entropy minimality ⋮ On girth and the parameterized complexity of token sliding and Token Jumping ⋮ Recolouring reflexive digraphs ⋮ Reconfiguring graph homomorphisms on the sphere ⋮ Reconfiguration of homomorphisms to reflexive digraph cycles ⋮ Algorithms for Coloring Reconfiguration Under Recolorability Constraints ⋮ Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters ⋮ Hedetniemi's Conjecture and Strongly Multiplicative Graphs ⋮ Using contracted solution graphs for solving reconfiguration problems ⋮ Introduction to reconfiguration ⋮ Complexity of Coloring Reconfiguration under Recolorability Constraints
This page was built for publication: Homomorphism reconfiguration via homotopy
