Circular-arc graphs with clique cover number two
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.
scientific article; zbMATH DE number 3959471
scientific article