Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Decomposition of sparse graphs into two forests, one having bounded maximum degree
scientific article

    Statements

    Decomposition of sparse graphs into two forests, one having bounded maximum degree (English)
    0 references
    0 references
    0 references
    0 references
    27 March 2012
    0 references
    maximum average degree
    0 references
    mad
    0 references
    combinatorial problems
    0 references
    edge partition
    0 references
    decomposition
    0 references
    forest with bounded degree
    0 references
    discharging procedure
    0 references
    global rules
    0 references

    Identifiers