Finding shortest paths between graph colourings (Q309791): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6624620 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph colouring
Property / zbMATH Keywords: graph colouring / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
reconfigurations
Property / zbMATH Keywords: reconfigurations / rank
 
Normal rank
Property / zbMATH Keywords
 
reconfiguration graphs
Property / zbMATH Keywords: reconfiguration graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed parameter tractability
Property / zbMATH Keywords: fixed parameter tractability / rank
 
Normal rank

Revision as of 23:45, 27 June 2023

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