Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs (Q4302282)

From MaRDI portal
Revision as of 21:25, 27 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 618158
Language Label Description Also known as
English
Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
scientific article; zbMATH DE number 618158

    Statements

    Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs (English)
    0 references
    0 references
    0 references
    14 August 1994
    0 references
    cocomparability graph
    0 references
    polynomial time algorithm
    0 references
    hamiltonian cycle
    0 references
    permutation graphs
    0 references
    partially ordered sets
    0 references

    Identifiers

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