Circular-arc graphs with clique cover number two (Q1078197)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Circular-arc graphs with clique cover number two
scientific article

    Statements

    Circular-arc graphs with clique cover number two (English)
    0 references
    1988
    0 references
    The problem of recognizing circular-arc graphs which can be partitioned into two cliques is reduced to the problem of recognizing whether certain partial orders are two dimensional. This simplifies Tucker's algorithm for recognizing circular-arc graphs.
    0 references
    dimension
    0 references
    two-dimensional partial orders
    0 references
    recognizing circular arc- graphs
    0 references
    0 references

    Identifiers