The Petersen graph is not 3-edge-colorable---a new proof (Q1398278)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The Petersen graph is not 3-edge-colorable---a new proof
scientific article

    Statements

    The Petersen graph is not 3-edge-colorable---a new proof (English)
    0 references
    0 references
    0 references
    29 July 2003
    0 references
    Petersen graph
    0 references
    edge-coloring
    0 references
    Hamiltonian cycle
    0 references
    0 references

    Identifiers