Circular-arc graphs with clique cover number two (Q1078197)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Circular-arc graphs with clique cover number two |
scientific article; zbMATH DE number 3959471
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circular-arc graphs with clique cover number two |
scientific article; zbMATH DE number 3959471 |
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
