Graphs of degree 4 are 5-edge-choosable (Q4718735)

From MaRDI portal
Revision as of 09:33, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1382612
Language Label Description Also known as
English
Graphs of degree 4 are 5-edge-choosable
scientific article; zbMATH DE number 1382612

    Statements

    0 references
    0 references
    0 references
    9 April 2000
    0 references
    list assignment
    0 references
    list coloring
    0 references
    \(L\)-edge-colorable
    0 references
    \(k\)-edge-choosable
    0 references
    Graphs of degree 4 are 5-edge-choosable (English)
    0 references

    Identifiers