Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable (Q3958483): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1253258
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Andrew G. Thomason / rank
 
Normal rank

Revision as of 23:04, 22 February 2024

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