Recoloring Planar Graphs of Girth at Least Five (Q5883290): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recoloring graphs of treewidth 2 / 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: Q3469114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast recoloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing 3-colourings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Randomly Sampling Colorings via Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An update on reconfiguring 10-colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Thomassen-type method for planar graph recoloring / 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: Islands in Graphs on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguring colorings of graphs with bounded maximum average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to reconfiguration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of change / rank
 
Normal rank

Latest revision as of 19:23, 31 July 2024

scientific article; zbMATH DE number 7669662
Language Label Description Also known as
English
Recoloring Planar Graphs of Girth at Least Five
scientific article; zbMATH DE number 7669662

    Statements

    Recoloring Planar Graphs of Girth at Least Five (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2023
    0 references
    graph coloring
    0 references
    planar graph
    0 references
    reconfiguration graph
    0 references

    Identifiers