Boxicity of Circular Arc Graphs
 Diptendu Bhowmick,
 L. Sunil Chandran
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
A kdimensional box is a Cartesian product R _{1} × · · · × R _{ k } where each R _{ i } is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of kdimensional boxes. That is, two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a graph that can be represented as the intersection graph of arcs on a circle. We show that if G is a circular arc graph which admits a circular arc representation in which no arc has length at least \({\pi(\frac{\alpha1}{\alpha})}\) for some \({\alpha\in\mathbb{N}_{\geq 2}}\) , then box(G) ≤ α (Here the arcs are considered with respect to a unit circle). From this result we show that if G has maximum degree \({\Delta < \lfloor{\frac{n(\alpha1)}{2\alpha}}\rfloor}\) for some \({\alpha \in \mathbb{N}_{\geq 2}}\) , then box(G) ≤ α. We also demonstrate a graph having box(G) > α but with \({\Delta=n\frac{(\alpha1)}{2\alpha}+ \frac{n}{2\alpha(\alpha+1)}+(\alpha+2)}\) . For a proper circular arc graph G, we show that if \({\Delta < \lfloor{\frac{n(\alpha1)}{\alpha}}\rfloor}\) for some \({\alpha\in \mathbb{N}_{\geq 2}}\) , then box(G) ≤ α. Let r be the cardinality of the minimum overlap set, i.e. the minimum number of arcs passing through any point on the circle, with respect to some circular arc representation of G. We show that for any circular arc graph G, box(G) ≤ r + 1 and this bound is tight. We show that if G admits a circular arc representation in which no family of k ≤ 3 arcs covers the circle, then box(G) ≤ 3 and if G admits a circular arc representation in which no family of k ≤ 4 arcs covers the circle, then box(G) ≤ 2. We also show that both these bounds are tight.
 Belkale, N., Chandran, L.S. (2009) Hadwiger’s conjecture for proper circular arc graphs. Eur. J. Combin. 30: pp. 946956 CrossRef
 Chandran, L., Das, A., Shah, C.D. (2009) Cubicity, boxicity and vertex cover. Disc. Math. 309: pp. 24882496 CrossRef
 Chandran, L.S., Sivadasan, N.: Geometric representation of graphs in low dimension using axis parallel boxes. Algorithmica. doi:10.1007/s0045300891635
 Chandran, L.S., Francis, M.C., Sivadasan, N. (2008) Boxicity and maximum degree. J. Combin. Theory Ser. B 98: pp. 443445 CrossRef
 Chandran, L.S., Sivadasan, N. (2007) Boxicity and treewidth. J. Combin. Theory Ser. B 97: pp. 733744 CrossRef
 Cozzens, M.B., Roberts, F.S. (1983) Computing the boxicity of a graph by covering its complement by cointerval graphs. Disc. Appl. Math. 6: pp. 217228 CrossRef
 Esperet, L. (2009) Boxicity of graphs with bounded degree. Eur. J. Combin. 30: pp. 12771280 CrossRef
 Freeman, L.C. (1983) Spheres, cubes and boxes: graph dimensionality and network structure. Soc. Netw. 5: pp. 139156 CrossRef
 Golumbic, M.C. (1980) Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York
 Golumbic, M.C., Hammer, P.L. (1988) Stability in circular arc graphs. J. Algorithms 9: pp. 314320 CrossRef
 Hell, P., Huang, J. (2004) Interval bigraphs and circular arc graphs. J. Graph Theory 46: pp. 313327 CrossRef
 Kloks, T., Kratsch, D., Müller, H. (1975) Coloring a family of circular arcs. SIAM J. Appl. Math. 29: pp. 493502 CrossRef
 Kratochvil, J. (1994) A special planar satisfiability problem and a consequence of its NPcompleteness. Disc. Appl. Math. 52: pp. 233252 CrossRef
 Lin, M.C., Rautenbach, D., Soulignac, F.J., Szwarcfiter, J.L.: Powers of cycles, powers of paths, and distance graphs, preprint (2009)
 Lin, M.C., Szwarcfiter, J.L. (2008) Unit circulararc graph representations and feasible circulations. SIAM J. Discrete Math. 22: pp. 409423 CrossRef
 Lin, M.C., Szwarcfiter, J.L. (2009) Characterizations and recognition of circulararc graphs and subclasses: a survey. Disc. Math. 309: pp. 56185635 CrossRef
 Min Chih Lin, F.J.S., Szwarcfiter, J.L.: The clique operator on circulararc graphs. Disc. Appl. Math. (2009, in press)
 Müller, H. (1997) Recognizing interval digraphs and interval bigraphs in polynomial time. Disc. Appl. Math. 78: pp. 189205 CrossRef
 Opsut, R., Roberts, F.: On the fleet maintainence, mobile radio frequency, task assignment, and traffic phasing problems in g. In: The Theory and Applications of Graphs. Wiley, New York (1981)
 Roberts, F.S.: Recent Progresses in combinatorics. In: On the Boxicity and Cubicity of a Graph. Academic Press, New York, pp. 301–310 (1969)
 Roberts, F.S. (1976) Discrete Mathematical Models with Applications to Social, Biological and Environmental Problems. PrenticeHall, Englewod Cliffs
 Scheinerman, E.R.: Intersection classes and multiple intersection parameters. PhD thesis, Princeton University (1984)
 Soulignac, F.: On proper and helly circulararc graphs. PhD thesis, Universidad de Buenos Aires (2010)
 Thomassen, C. (1986) Interval representations of planar graphs. J. Combin. Theory Ser. B 40: pp. 920 CrossRef
 Tucker, A. (1974) Structure theorems for some circulararc graphs. Disc. Math. 7: pp. 167195 CrossRef
 Yannakakis, M. (1982) The complexity of the partial order dimension problem. SIAM J. Alg. Disc. Math. 3: pp. 351358 CrossRef
 Title
 Boxicity of Circular Arc Graphs
 Journal

Graphs and Combinatorics
Volume 27, Issue 6 , pp 769783
 Cover Date
 20111101
 DOI
 10.1007/s0037301010021
 Print ISSN
 09110119
 Online ISSN
 14355914
 Publisher
 Springer Japan
 Additional Links
 Topics
 Keywords

 Boxicity
 Circular arc graph
 Minimum overlap set
 Maximum circular cover number
 Industry Sectors
 Authors

 Diptendu Bhowmick ^{(1)}
 L. Sunil Chandran ^{(1)}
 Author Affiliations

 1. Computer Science and Automation Department, Indian Institute of Science, Bangalore, 560012, India