{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:26Z","timestamp":1759063406965},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":[[1989,12]]},"DOI":"10.1007\/bf01788656","type":"journal-article","created":{"date-parts":[[2005,6,19]],"date-time":"2005-06-19T14:46:51Z","timestamp":1119192411000},"page":"29-46","source":"Crossref","is-referenced-by-count":12,"title":["On dimensional properties of graphs"],"prefix":"10.1007","volume":"5","author":[{"given":"Margaret Barry","family":"Cozzens","sequence":"first","affiliation":[]},{"given":"Fred S.","family":"Roberts","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01788656_CR1","unstructured":"Balas, E.: Box Representations of a Family of Ellipsoids. Lecture at the Thirteenth Southeastern Conference on Graph Theory, Combinatorics, and Computing. Boca Raton, FL February 1982"},{"key":"BF01788656_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. New York: American Elsevier 1976"},{"key":"BF01788656_CR3","volume-title":"Circle graphs. Courant Computer Science Report No. 21","author":"M. Buckingham","year":"1980","unstructured":"Buckingham, M.: Circle graphs. Courant Computer Science Report No. 21. New York: New York University 1980"},{"key":"BF01788656_CR4","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1137\/0605055","volume":"5","author":"M.B. Cozzens","year":"1984","unstructured":"Cozzens, M.B., Leibowitz, R.: Threshold dimension of graphs. SIAM J. Algebraic Discrete Methods,5, 579\u2013595 (1984)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF01788656_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-2496(87)90014-9","volume":"31","author":"M.B. Cozzens","year":"1987","unstructured":"Cozzens, M.B., Leibowitz, R.: Multidimensional scaling and threshold graphs. J. Math. Psychol.31, 179\u2013191 (1987)","journal-title":"J. Math. Psychol."},{"key":"BF01788656_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. Discrete Appl. Math.6, 217\u2013228 (1983)","journal-title":"Discrete Appl. Math."},{"key":"BF01788656_CR7","first-page":"14","volume":"9","author":"M.B. Cozzens","year":"1984","unstructured":"Cozzens, M.B., Roberts, F.S.: Onk-suitable sets of arrangements and the boxicity of a graph. J. Comb. Inf. Syst. Sci.9, 14\u201324 (1984)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"BF01788656_CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1002\/jgt.3190040207","volume":"4","author":"A. Donald","year":"1980","unstructured":"Donald, A.: An upper bound for the path number of a graph. J. Graph Theory4, 189\u2013201 (1980)","journal-title":"J. Graph Theory"},{"key":"BF01788656_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0012-365X(79)90149-3","volume":"25","author":"R.B. Feinberg","year":"1979","unstructured":"Feinberg, R.B.: The circular dimension of a graph. Discrete Math.25, 27\u201331 (1979)","journal-title":"Discrete Math."},{"key":"BF01788656_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0095-8956(83)90057-6","volume":"35","author":"P.C. Fishburn","year":"1983","unstructured":"Fishburn, P.C.: On the sphericity and cubicity of graphs. J. Comb. Theory (B)35, 309\u2013318 (1983)","journal-title":"J. Comb. Theory (B)"},{"key":"BF01788656_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230030305","volume":"3","author":"F. Gavril","year":"1973","unstructured":"Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks3, 261\u2013273 (1973)","journal-title":"Networks"},{"key":"BF01788656_CR12","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P.C. Gilmore","year":"1964","unstructured":"Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Canad. J. Math.16, 539\u2013548 (1964)","journal-title":"Canad. J. Math."},{"key":"BF01788656_CR13","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press 1980"},{"key":"BF01788656_CR14","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1137\/0606049","volume":"6","author":"P.L. Hammer","year":"1985","unstructured":"Hammer, P.L., Mahadev, N.V.R.: Bithreshold graphs. SIAM J. Algebraic Discrete Methods6, 497\u2013506 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF01788656_CR15","volume-title":"Intersection graphs: structure and invariants","author":"J.A. Kabell","year":"1980","unstructured":"Kabell, J.A.: Intersection graphs: structure and invariants. Doctoral dissertation, University of Michigan. Ann Arbor, MI 1980"},{"key":"BF01788656_CR16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C.G. Lekkerkerker","year":"1962","unstructured":"Lekkerkerker, C.G., Boland, J. Ch.: Representation of a finite graph by a set of intervals on the real line. Fundam. Math.51, 45\u201364. (1962)","journal-title":"Fundam. Math."},{"key":"BF01788656_CR17","first-page":"231","volume-title":"Theory of Graphs (Proc. Colloq. Tihany, Hungary, September 1966)","author":"L. Lovasz","year":"1968","unstructured":"Lovasz, L.: On coverings of graphs. In: Theory of Graphs (Proc. Colloq. Tihany, Hungary, September 1966), pp. 231\u2013236. New York: Academic Press 1968"},{"key":"BF01788656_CR18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0095-8956(86)90081-X","volume":"40","author":"H. Maehara","year":"1986","unstructured":"Maehara, H.: Sphericity exceeds cubicity for almost all complete bipartite graphs. J. Comb. Theory (B)40, 231\u2013235 (1986)","journal-title":"J. Comb. Theory (B)"},{"key":"BF01788656_CR19","first-page":"406","volume":"80","author":"J. Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: Covering graphs with cliques. Proc. of the Koninklijke Nederlandse Academie van Wetenschappen Amsterdam, Series A80, 406\u2013424 (1977)","journal-title":"Proc. of the Koninklijke Nederlandse Academie van Wetenschappen Amsterdam, Series A"},{"key":"BF01788656_CR20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/0213005","volume":"13","author":"N.J. Pullman","year":"1984","unstructured":"Pullman, N.J.: Clique coverings of graphs IV: Algorithms. SIAM J. Comput.13, 57\u201375 (1984)","journal-title":"SIAM J. Comput."},{"key":"BF01788656_CR21","first-page":"795","volume":"29","author":"N.J. Pullman","year":"1980","unstructured":"Pullman, N.J., DeCaen, D.: Clique coverings of graphs III: Clique coverings of regular graphs. Congr. Numerantium29, 795\u2013808 (1980)","journal-title":"Congr. Numerantium"},{"key":"BF01788656_CR22","first-page":"139","volume-title":"Proof Techniques in Graph Theory","author":"F.S. Roberts","year":"1969","unstructured":"Roberts, F.S.: Indifference graphs. In: Proof Techniques in Graph Theory, edited by F. Harary pp. 139\u2013146. New York: Academic Press 1969 (a)"},{"key":"BF01788656_CR23","first-page":"301","volume-title":"Recent Progress in Combinatorics","author":"F.S. Roberts","year":"1969","unstructured":"Roberts, F.S.: On the boxicity and cubicity of a graph. In: Recent Progress in Combinatorics, edited by W.T. Tutte pp. 301\u2013310. New York: Academic Press 1969 (b)"},{"key":"BF01788656_CR24","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. Englewood Cliffs, NJ: Prentice-Hall 1976"},{"key":"BF01788656_CR25","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970401","volume-title":"Graph Theory and its Applications to Problems of Society, NSF-CBMS Monograph #29","author":"F.S. Roberts","year":"1978","unstructured":"Roberts, F.S.: Graph Theory and its Applications to Problems of Society, NSF-CBMS Monograph #29. Philadelphia, PA: SIAM Publications 1978"},{"key":"BF01788656_CR26","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0166-218X(85)90061-7","volume":"10","author":"F.S. Roberts","year":"1985","unstructured":"Roberts, F.S.: Applications of edge coverings by cliques. Discrete Appl. Math.10, 93\u2013109 (1985)","journal-title":"Discrete Appl. Math."},{"key":"BF01788656_CR27","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(90)90290-X","volume":"29","author":"J.B. Shearer","year":"1980","unstructured":"Shearer, J.B.: A note on circular dimension. Discrete Math.29, 103 (1980)","journal-title":"Discrete Math."},{"key":"BF01788656_CR28","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0012-365X(79)90137-7","volume":"28","author":"W.T. Trotter","year":"1979","unstructured":"Trotter, W.T.: A characterization of Roberts' inequality for boxicity. Discrete Math.28, 303\u2013314 (1979)","journal-title":"Discrete Math."},{"key":"BF01788656_CR29","doi-asserted-by":"crossref","first-page":"1257","DOI":"10.1090\/S0002-9904-1970-12628-3","volume":"76","author":"A.C. Tucker","year":"1970","unstructured":"Tucker, A.C.: Characterizing circular-arc graphs. Bull. Amer. Math. Soc.76, 1257\u20131260 (1970)","journal-title":"Bull. Amer. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788656.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01788656\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01788656","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T09:56:51Z","timestamp":1557395811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01788656"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["BF01788656"],"URL":"https:\/\/doi.org\/10.1007\/bf01788656","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}