Cycle covers of cubic multigraphs (Q686431)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Cycle covers of cubic multigraphs
scientific article

    Statements

    Cycle covers of cubic multigraphs (English)
    0 references
    0 references
    0 references
    20 December 1993
    0 references
    The authors give an alternative proof that any planar multigraph has a cycle \(w\)-cover for any admissible weight \(w\). Their proof does not use the four-color theorem, and provides an extension to admissible (1,2)- weighted cubic multigraphs not containing a subdivision of the Petersen graph.
    0 references
    cycle covers
    0 references
    planar multigraph
    0 references
    cubic multigraphs
    0 references
    Petersen graph
    0 references

    Identifiers