An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An efficient case for computing minimum linear arboricity with small maximum degree
scientific article

    Statements

    An efficient case for computing minimum linear arboricity with small maximum degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 May 2019
    0 references
    linear arboricity
    0 references
    cycles
    0 references
    planar graph
    0 references

    Identifiers