Two sufficient conditions for a planar graph to be list vertex-2-arborable (Q2124649)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Two sufficient conditions for a planar graph to be list vertex-2-arborable
scientific article

    Statements

    Two sufficient conditions for a planar graph to be list vertex-2-arborable (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 April 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graph
    0 references
    list vertex-arboricity
    0 references
    list-forested-coloring
    0 references
    cycle
    0 references
    0 references