Packing a number of copies of a \(( p , q )\)-graph (Q2217483)

From MaRDI portal
Revision as of 07:01, 24 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Packing a number of copies of a \(( p , q )\)-graph
scientific article

    Statements

    Packing a number of copies of a \(( p , q )\)-graph (English)
    0 references
    0 references
    0 references
    29 December 2020
    0 references
    0 references
    \( ( p
    0 references
    q )\)-graph
    0 references
    2-factor
    0 references
    \(k\)-placeable
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references