Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522)

From MaRDI portal
Revision as of 20:22, 13 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
Planar graphs without intersecting 5-cycles are 4-choosable
scientific article

    Statements

    Identifiers