Planar graphs are \(9/2\)-colorable (Q1791701): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A lower bound for the independence number of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs have independence ratio at least 3/13 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (<5)-Colour Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of the 5-Color Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_{5}\)-free bound for the class of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Folding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hedetniemi's conjecture---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank

Revision as of 19:48, 16 July 2024

scientific article
Language Label Description Also known as
English
Planar graphs are \(9/2\)-colorable
scientific article

    Statements

    Planar graphs are \(9/2\)-colorable (English)
    0 references
    0 references
    0 references
    11 October 2018
    0 references
    4 color theorem
    0 references
    coloring
    0 references
    planar
    0 references
    homomorphism
    0 references
    fractional coloring
    0 references

    Identifiers