Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077)

From MaRDI portal
Revision as of 14:39, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
scientific article

    Statements

    Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    choosability
    0 references
    list-coloring
    0 references
    planar graphs
    0 references
    short cycles
    0 references

    Identifiers