Reconfiguring colorings of graphs with bounded maximum average degree (Q2222045): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast recoloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Cereceda's conjecture for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths between colourings of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguring 10-colourings of planar graphs / rank
 
Normal rank

Latest revision as of 11:32, 24 July 2024

scientific article
Language Label Description Also known as
English
Reconfiguring colorings of graphs with bounded maximum average degree
scientific article

    Statements

    Reconfiguring colorings of graphs with bounded maximum average degree (English)
    0 references
    0 references
    3 February 2021
    0 references
    graph recoloring
    0 references
    sparse graphs
    0 references

    Identifiers

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