Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673)

From MaRDI portal
Revision as of 02:22, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Planar graphs without cycles of length from 4 to 7 are 3-colorable
scientific article

    Statements

    Planar graphs without cycles of length from 4 to 7 are 3-colorable (English)
    0 references
    0 references
    0 references
    8 March 2005
    0 references
    Planar graphs
    0 references
    3-coloring
    0 references
    Steinberg's conjecture
    0 references

    Identifiers