Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563)

From MaRDI portal
Revision as of 11:36, 22 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable
scientific article

    Statements

    Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (English)
    0 references
    0 references
    0 references
    23 April 2020
    0 references
    improper coloring
    0 references
    planar graph
    0 references
    discharging method
    0 references

    Identifiers