Covering a cubic graph by 5 perfect matchings (Q2397531)

From MaRDI portal
Revision as of 01:07, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Covering a cubic graph by 5 perfect matchings
scientific article

    Statements

    Covering a cubic graph by 5 perfect matchings (English)
    0 references
    0 references
    22 May 2017
    0 references
    Berge conjecture
    0 references
    Fulkerson conjecture
    0 references
    perfect matching cover
    0 references
    cubic graph
    0 references
    hypo-Hamiltonian graph
    0 references

    Identifiers