Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (Q3958483)

From MaRDI portal
Revision as of 15:25, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/jgt/Thomason82, #quickstatements; #temporary_batch_1731505720702)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
scientific article

    Statements

    Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (English)
    0 references
    1982
    0 references
    edge coloring
    0 references
    generalized Petersen graph
    0 references
    0 references

    Identifiers