Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1705.07551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoloring graphs via tree decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs / 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: The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration / 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: Finding paths between 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly coloring sparse random graphs with fewer colors than the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of reconfiguration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest paths between graph colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time modular decomposition of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / 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: Homomorphism reconfiguration via homotopy / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964264940 / rank
 
Normal rank
Property / title
 
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (English)
Property / title: Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:05, 30 July 2024

scientific article; zbMATH DE number 7204385
Language Label Description Also known as
English
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
scientific article; zbMATH DE number 7204385

    Statements

    0 references
    0 references
    0 references
    26 May 2020
    0 references
    combinatorial reconfiguration
    0 references
    fixed-parameter tractability
    0 references
    graph algorithm
    0 references
    list coloring
    0 references
    W[1]-hardness
    0 references
    Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references