Token sliding on graphs of girth five (Q6182683): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A dichotomy theorem for circular colouring 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: Connectedness of the graph of vertex-colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of list edge-colorings in a graph / 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: Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flip distance between two triangulations of a point set is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ground State Connectivity of Local Hamiltonians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Independent Set in H-Free Graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Token sliding on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguring Independent Sets in Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithm for Sliding Tokens on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sliding Token on Bipartite Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Complexity for Token Jumping on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of independent set reconfigurability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration on sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration in bounded bandwidth and tree-depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Token sliding on split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Independent Set Reconfiguration on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On girth and the parameterized complexity of token sliding and Token Jumping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galactic token sliding / rank
 
Normal rank

Latest revision as of 20:59, 23 August 2024

scientific article; zbMATH DE number 7795038
Language Label Description Also known as
English
Token sliding on graphs of girth five
scientific article; zbMATH DE number 7795038

    Statements

    Token sliding on graphs of girth five (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 January 2024
    0 references
    token sliding
    0 references
    independent set
    0 references
    girth
    0 references
    combinatorial reconfiguration
    0 references
    parameterized complexity
    0 references
    0 references
    0 references

    Identifiers