Reconfiguration of List Edge-Colorings in a Graph (Q3183470): 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: List edge and list total colourings of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfigurations in Graphs and Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3104271 / 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: 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: On the Complexity of Reconfiguration Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank

Latest revision as of 02:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Reconfiguration of List Edge-Colorings in a Graph
scientific article

    Statements