\(k\)-NLC graphs and polynomial algorithms (Q1336631)

From MaRDI portal
Revision as of 11:04, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)





scientific article
Language Label Description Also known as
English
\(k\)-NLC graphs and polynomial algorithms
scientific article

    Statements

    \(k\)-NLC graphs and polynomial algorithms (English)
    0 references
    0 references
    3 November 1994
    0 references
    \(k\)-node label controlled graphs
    0 references
    simple max-cut problem
    0 references
    Hamiltonian circuit property
    0 references

    Identifiers

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