A clique-covering sufficient condition for hamiltonicity of graphs (Q990948)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A clique-covering sufficient condition for hamiltonicity of graphs
scientific article

    Statements

    A clique-covering sufficient condition for hamiltonicity of graphs (English)
    0 references
    0 references
    0 references
    1 September 2010
    0 references
    design of algorithms
    0 references
    graph theory
    0 references
    Hamiltonian problem
    0 references
    Hamiltonian graph
    0 references
    clique decomposition condition
    0 references
    hamiltonicity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references