Reconfiguration of list edge-colorings in a graph (Q713316): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Marcin Kaminski / rank
Normal rank
 
Property / author
 
Property / author: Marcin Kaminski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.05.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970459509 / rank
 
Normal rank
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: Q3395518 / 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: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Paths between Shortest Paths and Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:10, 5 July 2024

scientific article
Language Label Description Also known as
English
Reconfiguration of list edge-colorings in a graph
scientific article

    Statements

    Reconfiguration of list edge-colorings in a graph (English)
    0 references
    0 references
    0 references
    0 references
    26 October 2012
    0 references
    0 references
    graph algorithm
    0 references
    list edge-coloring
    0 references
    planar graph
    0 references
    PSPACE-complete
    0 references
    reachability on solution space
    0 references
    reconfiguration problem
    0 references
    tree
    0 references
    0 references