Finding shortest paths between graph colourings (Q309791)

From MaRDI portal
Revision as of 20:41, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Finding shortest paths between graph colourings
scientific article

    Statements

    Finding shortest paths between graph colourings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2016
    0 references
    graph colouring
    0 references
    graph algorithms
    0 references
    reconfigurations
    0 references
    reconfiguration graphs
    0 references
    fixed parameter tractability
    0 references

    Identifiers