All \(P_{3}\)-equipackable graphs (Q960935)

From MaRDI portal
scientific article
Language Label Description Also known as
English
All \(P_{3}\)-equipackable graphs
scientific article

    Statements

    All \(P_{3}\)-equipackable graphs (English)
    0 references
    0 references
    29 March 2010
    0 references
    A connected graph \(G\) is called equipackable if \textit{any} sequence of removals of two adjacent edges terminates with the empty graph (if \(G\) has an even number of edges) or with a single edge (if \(G\) has an odd number of edges). This paper characterizes all equipackable graphs.
    0 references
    Packing
    0 references
    Equitable
    0 references
    Decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers