Strengthening a Theorem of Meyniel (Q6158364): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Geometric coloring theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Les 5-colorations d'un graphe planaire forment une classe de commutation unique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kempe classes and the Hadwiger conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Planar Map is Four Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Mohar concerning Kempe equivalence of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial version of Cereceda's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / 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: Akempic triangulations with 4 odd vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank

Latest revision as of 06:42, 1 August 2024

scientific article; zbMATH DE number 7690457
Language Label Description Also known as
English
Strengthening a Theorem of Meyniel
scientific article; zbMATH DE number 7690457

    Statements

    Strengthening a Theorem of Meyniel (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 May 2023
    0 references
    0 references
    planar graph
    0 references
    reconfiguration
    0 references
    coloring
    0 references
    0 references
    0 references