Posets with interval upper bound graphs (Q1104348)

From MaRDI portal
Revision as of 10:51, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Posets with interval upper bound graphs
scientific article

    Statements

    Posets with interval upper bound graphs (English)
    0 references
    0 references
    0 references
    1986
    0 references
    Competition graphs of transitive acyclic digraphs are strict upper bound graphs. In this paper the author characterizes those posets which can be considered transitive acyclic digraphs which have bound graphs that are interval graphs.
    0 references
    Competition graphs
    0 references
    transitive acyclic digraphs
    0 references
    upper bound graphs
    0 references
    interval graphs
    0 references

    Identifiers

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