Recolouring homomorphisms to triangle-free reflexive graphs (Q2688244): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph homomorphism reconfiguration and frozen H‐colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recolouring reflexive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for circular colouring reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gibbs measures and dismantlable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths between 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5471351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete homotopy theory for binary reflexive structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguring graph homomorphisms on the sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism reconfiguration via homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism Reconfiguration via Homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank
 
Normal rank

Latest revision as of 15:30, 31 July 2024

scientific article
Language Label Description Also known as
English
Recolouring homomorphisms to triangle-free reflexive graphs
scientific article

    Statements

    Recolouring homomorphisms to triangle-free reflexive graphs (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2023
    0 references
    0 references
    reflexive graph
    0 references
    graph recolouring
    0 references
    homomorphism reconfiguration
    0 references
    computational complexity
    0 references
    0 references