On powers of circular arc graphs and proper circular arc graphs
β Scribed by Carsten Flotow
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 537 KB
- Volume
- 69
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__β__graph__ (resp., __F__\*β__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in
## Abstract We introduce a simple new technique which allows us to solve several problems that can be formulated as seeking a suitable orientation of a given undirected graph. In particular, we use this technique to recognize and transitively orient comparability graphs, to recognize and represent