## Abstract A circularβarc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction. We characterize circularβarc graphs by a list of minim
Circular-arc digraphs: A characterization
β Scribed by M. Sen; S. Das; Douglas B. West
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 390 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In this paper we give a construction that produces exactly those graphs having maximum rectilinear crossing number equal to the subthrackle bound. We then prove a theorem characterizing these graphs in terms of proper circularβarc graphs. Β© 1996 John Wiley & Sons, Inc.
## Abstract We introduce the circular chromatic number Ο~__c__~ of a digraph and establish various basic results. They show that the coloring theory for digraphs is similar to the coloring theory for undirected graphs when independent sets of vertices are replaced by acyclic sets. Since the directe
For the special type of weight functions on circular arc we study the asymptotic behavior of the Christoffel kernel off the arc and of the Christoffel function inside the arc. We prove Totik's conjecture for the Christoffel function corresponding to such weight functions.
Dual-frequency operation of a single-feed circular microstrip antenna with a pair of arc-shaped slots is demonstrated. Typical designs of the proposed antenna with the frequency ratio of the two operating frequencies ranging from 1.38 to 1.58 are implemented and studied. The frequency ratio can easi