✦ LIBER ✦

Boxicity of Circular Arc Graphs

✍ Scribed by Diptendu Bhowmick; L. Sunil Chandran

Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 352 KB
Volume: 27
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-1002-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On powers of circular arc graphs and pro

On powers of circular arc graphs and proper circular arc graphs

✍ Carsten Flotow 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 537 KB

Poset boxicity of graphs

✍ W.T Trotter Jr.; Douglas B West 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 197 KB

A t-box representation of a graph encodes each vertex as a box in t-space determined by the (integer) coordinates of its lower and upper corner, such that vertices are adjacent if and only if the corresponding boxes intersect. The boxicity of a graph G is the minirmlm t for which this can be done; e

Stability in circular arc graphs

✍ Martin Charles Golumbic; Peter L Hammer 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Algorithms on circular-arc graphs

✍ F. Gavril 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 596 KB

Irredundancy in circular arc graphs

✍ Martin Charles Golumbic; Renu C. Laskar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 676 KB

Partial characterizations of circular-ar

Partial characterizations of circular-arc graphs

✍ F. Bonomo; G. Durán; L.N. Grippo; M.D. Safe 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## 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