An effective algorithm for the enumeration of edge colorings and Hamiltonian cycles in cubic graphs (Q6478110)

From MaRDI portal
Revision as of 18:24, 27 June 2024 by ArxivImporter (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 900080529
Language Label Description Also known as
English
An effective algorithm for the enumeration of edge colorings and Hamiltonian cycles in cubic graphs
scientific article; zbMATH DE number 900080529

    Statements

    26 October 2006
    0 references
    math.CO
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers