{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:37:06Z","timestamp":1773409026433,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,12,18]],"date-time":"2010-12-18T00:00:00Z","timestamp":1292630400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00373-010-1002-1","type":"journal-article","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T04:44:38Z","timestamp":1292561078000},"page":"769-783","source":"Crossref","is-referenced-by-count":4,"title":["Boxicity of Circular Arc Graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Diptendu","family":"Bhowmick","sequence":"first","affiliation":[]},{"given":"L. Sunil","family":"Chandran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,18]]},"reference":[{"issue":"4","key":"1002_CR1","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1016\/j.ejc.2008.07.024","volume":"30","author":"N. Belkale","year":"2009","unstructured":"Belkale N., Chandran L.S.: Hadwiger\u2019s conjecture for proper circular arc graphs. Eur. J. Combin. 30(4), 946\u2013956 (2009)","journal-title":"Eur. J. Combin."},{"issue":"8","key":"1002_CR2","doi-asserted-by":"crossref","first-page":"2488","DOI":"10.1016\/j.disc.2008.06.003","volume":"309","author":"L. Chandran","year":"2009","unstructured":"Chandran L., Das A., Shah C.D.: Cubicity, boxicity and vertex cover. Disc. Math. 309(8), 2488\u20132496 (2009)","journal-title":"Disc. Math."},{"key":"1002_CR3","doi-asserted-by":"crossref","unstructured":"Chandran, L.S., Sivadasan, N.: Geometric representation of graphs in low dimension using axis parallel boxes. Algorithmica. doi: 10.1007\/s00453-008-9163-5","DOI":"10.1007\/s00453-008-9163-5"},{"issue":"2","key":"1002_CR4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.jctb.2007.08.002","volume":"98","author":"L.S. Chandran","year":"2008","unstructured":"Chandran L.S., Francis M.C., Sivadasan N.: Boxicity and maximum degree. J. Combin. Theory Ser. B 98(2), 443\u2013445 (2008)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5","key":"1002_CR5","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1016\/j.jctb.2006.12.004","volume":"97","author":"L.S. Chandran","year":"2007","unstructured":"Chandran L.S., Sivadasan N.: Boxicity and treewidth. J. Combin. Theory Ser. B 97(5), 733\u2013744 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1002_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(83)90077-X","volume":"6","author":"M.B. Cozzens","year":"1983","unstructured":"Cozzens M.B., Roberts F.S.: Computing the boxicity of a graph by covering its complement by cointerval graphs. Disc. Appl. Math. 6, 217\u2013228 (1983)","journal-title":"Disc. Appl. Math."},{"issue":"5","key":"1002_CR7","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1016\/j.ejc.2008.10.003","volume":"30","author":"L. Esperet","year":"2009","unstructured":"Esperet L.: Boxicity of graphs with bounded degree. Eur. J. Combin. 30(5), 1277\u20131280 (2009)","journal-title":"Eur. J. Combin."},{"key":"1002_CR8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0378-8733(83)90022-9","volume":"5","author":"L.C. Freeman","year":"1983","unstructured":"Freeman L.C.: Spheres, cubes and boxes: graph dimensionality and network structure. Soc. Netw. 5, 139\u2013156 (1983)","journal-title":"Soc. Netw."},{"key":"1002_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"issue":"3","key":"1002_CR10","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/0196-6774(88)90023-5","volume":"9","author":"M.C. Golumbic","year":"1988","unstructured":"Golumbic M.C., Hammer P.L.: Stability in circular arc graphs. J. Algorithms 9(3), 314\u2013320 (1988)","journal-title":"J. Algorithms"},{"issue":"4","key":"1002_CR11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/jgt.20006","volume":"46","author":"P. Hell","year":"2004","unstructured":"Hell P., Huang J.: Interval bigraphs and circular arc graphs. J. Graph Theory 46(4), 313\u2013327 (2004)","journal-title":"J. Graph Theory"},{"issue":"3","key":"1002_CR12","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0129040","volume":"29","author":"T. Kloks","year":"1975","unstructured":"Kloks T., Kratsch D., M\u00fcller H.: Coloring a family of circular arcs. SIAM J. Appl. Math. 29(3), 493\u2013502 (1975)","journal-title":"SIAM J. Appl. Math."},{"key":"1002_CR13","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J. Kratochvil","year":"1994","unstructured":"Kratochvil J.: A special planar satisfiability problem and a consequence of its NP-completeness. Disc. Appl. Math. 52, 233\u2013252 (1994)","journal-title":"Disc. Appl. Math."},{"key":"1002_CR14","unstructured":"Lin, M.C., Rautenbach, D., Soulignac, F.J., Szwarcfiter, J.L.: Powers of cycles, powers of paths, and distance graphs, preprint (2009)"},{"issue":"1","key":"1002_CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/060650805","volume":"22","author":"M.C. Lin","year":"2008","unstructured":"Lin M.C., Szwarcfiter J.L.: Unit circular-arc graph representations and feasible circulations. SIAM J. Discrete Math. 22(1), 409\u2013423 (2008)","journal-title":"SIAM J. Discrete Math."},{"issue":"18","key":"1002_CR16","doi-asserted-by":"crossref","first-page":"5618","DOI":"10.1016\/j.disc.2008.04.003","volume":"309","author":"M.C. Lin","year":"2009","unstructured":"Lin M.C., Szwarcfiter J.L.: Characterizations and recognition of circular-arc graphs and subclasses: a survey. Disc. Math. 309(18), 5618\u20135635 (2009)","journal-title":"Disc. Math."},{"key":"1002_CR17","unstructured":"Min Chih Lin, F.J.S., Szwarcfiter, J.L.: The clique operator on circular-arc graphs. Disc. Appl. Math. (2009, in press)"},{"issue":"1-3","key":"1002_CR18","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0166-218X(97)00027-9","volume":"78","author":"H. M\u00fcller","year":"1997","unstructured":"M\u00fcller H.: Recognizing interval digraphs and interval bigraphs in polynomial time. Disc. Appl. Math. 78(1-3), 189\u2013205 (1997)","journal-title":"Disc. Appl. Math."},{"key":"1002_CR19","unstructured":"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)"},{"key":"1002_CR20","unstructured":"Roberts, F.S.: Recent Progresses in combinatorics. In: On the Boxicity and Cubicity of a Graph. Academic Press, New York, pp. 301\u2013310 (1969)"},{"key":"1002_CR21","volume-title":"Discrete Mathematical Models with Applications to Social, Biological and Environmental Problems","author":"F.S. Roberts","year":"1976","unstructured":"Roberts F.S.: Discrete Mathematical Models with Applications to Social, Biological and Environmental Problems. Prentice-Hall, Englewod Cliffs (1976)"},{"key":"1002_CR22","unstructured":"Scheinerman, E.R.: Intersection classes and multiple intersection parameters. PhD thesis, Princeton University (1984)"},{"key":"1002_CR23","unstructured":"Soulignac, F.: On proper and helly circular-arc graphs. PhD thesis, Universidad de Buenos Aires (2010)"},{"key":"1002_CR24","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0095-8956(86)90061-4","volume":"40","author":"C. Thomassen","year":"1986","unstructured":"Thomassen C.: Interval representations of planar graphs. J. Combin. Theory Ser. B 40, 9\u201320 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1002_CR25","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0012-365X(74)80027-0","volume":"7","author":"A. Tucker","year":"1974","unstructured":"Tucker A.: Structure theorems for some circular-arc graphs. Disc. Math. 7, 167\u2013195 (1974)","journal-title":"Disc. Math."},{"issue":"3","key":"1002_CR26","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"Yannakakis M.: The complexity of the partial order dimension problem. SIAM J. Alg. Disc. Math. 3(3), 351\u2013358 (1982)","journal-title":"SIAM J. Alg. Disc. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-1002-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-1002-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-1002-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T01:00:50Z","timestamp":1559869250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-1002-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,18]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["1002"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-1002-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,18]]}}}