The complexity of finding a second Hamiltonian cycle in cubic graphs (Q1307702)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of finding a second Hamiltonian cycle in cubic graphs
scientific article

    Statements

    The complexity of finding a second Hamiltonian cycle in cubic graphs (English)
    0 references
    0 references
    9 November 1999
    0 references
    cubic graph
    0 references
    Hamiltonian cycles
    0 references

    Identifiers