{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:07:08Z","timestamp":1773670028290,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,5,12]],"date-time":"2012-05-12T00:00:00Z","timestamp":1336780800000},"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":[[2013,9]]},"DOI":"10.1007\/s00373-012-1188-5","type":"journal-article","created":{"date-parts":[[2012,5,11]],"date-time":"2012-05-11T11:09:58Z","timestamp":1336734598000},"page":"1543-1547","source":"Crossref","is-referenced-by-count":4,"title":["A Generalization of Opsut\u2019s Lower Bounds for the Competition Number of a Graph"],"prefix":"10.1007","volume":"29","author":[{"given":"Yoshio","family":"Sano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,12]]},"reference":[{"key":"1188_CR1","unstructured":"Cohen, J.E.: Interval graphs and food webs: a finding and a problem, Document 17696-PR. RAND Corporation, Santa Monica (1968)"},{"key":"1188_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0166-218X(83)90085-9","volume":"6","author":"R.D. Dutton","year":"1983","unstructured":"Dutton R.D., Brigham R.C.: A characterization of competition graphs. Discret. Appl. Math. 6, 315\u2013317 (1983)","journal-title":"Discret. Appl. Math."},{"key":"1188_CR3","first-page":"313","volume-title":"Quo Vadis, Graph Theory? Annals of Discrete Mathematics, vol. 55","author":"S.-R. Kim","year":"1993","unstructured":"Kim S.-R.: The competition number and its variants. In: Gimbel, J., Kennedy, J.W., Quintas, L.V. (eds.) Quo Vadis, Graph Theory? Annals of Discrete Mathematics, vol. 55, pp. 313\u2013326. North Holland B. V., Amsterdam (1993)"},{"key":"1188_CR4","doi-asserted-by":"crossref","first-page":"3522","DOI":"10.1016\/j.dam.2008.04.009","volume":"156","author":"S.-R. Kim","year":"2008","unstructured":"Kim S.-R., Sano Y.: The competition numbers of complete tripartite graphs. Discret. Appl. Math. 156, 3522\u20133524 (2008)","journal-title":"Discret. Appl. Math."},{"key":"1188_CR5","doi-asserted-by":"crossref","first-page":"449","DOI":"10.7151\/dmgt.1506","volume":"30","author":"S.-R. Kim","year":"2010","unstructured":"Kim S.-R., Park B., Sano Y.: The competition numbers of Johnson graphs. Discuss. Math. Graph Theory 30, 449\u2013459 (2010)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1188_CR6","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1016\/j.dam.2011.12.017","volume":"160","author":"S.-R. Kim","year":"2012","unstructured":"Kim S.-R., Park B., Sano Y.: The competition numbers of complete multipartite graphs with many partite sets. Discret. Appl. Math. 160, 1176\u20131182 (2012)","journal-title":"Discret. Appl. Math."},{"key":"1188_CR7","doi-asserted-by":"crossref","unstructured":"Kim, S.-R., Park, B., Sano, Y.: The competition number of the complement of a cycle. Discret. Appl. Math. (2011). doi: 10.1016\/j.dam.2011.10.034","DOI":"10.1016\/j.dam.2011.10.034"},{"key":"1188_CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0166-218X(97)00026-7","volume":"78","author":"S.-R. Kim","year":"1997","unstructured":"Kim S.-R., Roberts F.S.: Competition numbers of graphs with a small number of triangles. Discret. Appl. Math. 78, 153\u2013162 (1997)","journal-title":"Discret. Appl. Math."},{"key":"1188_CR9","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0166-218X(83)90086-0","volume":"6","author":"J.R. Lundgren","year":"1983","unstructured":"Lundgren J.R., Maybee J.S.: A characterization of graphs of competition number m. Discret. Appl. Math. 6, 319\u2013322 (1983)","journal-title":"Discret. Appl. Math."},{"key":"1188_CR10","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/0603043","volume":"3","author":"R.J. Opsut","year":"1982","unstructured":"Opsut R.J.: On the computation of the competition number of a graph. SIAM J. Algebr. Discret. Methods 3, 420\u2013428 (1982)","journal-title":"SIAM J. Algebr. Discret. Methods"},{"key":"1188_CR11","doi-asserted-by":"crossref","first-page":"6464","DOI":"10.1016\/j.disc.2009.06.016","volume":"309","author":"B. Park","year":"2009","unstructured":"Park B., Kim S.-R., Sano Y.: The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares. Discret. Math. 309, 6464\u20136469 (2009)","journal-title":"Discret. Math."},{"key":"1188_CR12","doi-asserted-by":"crossref","first-page":"691","DOI":"10.4134\/JKMS.2011.48.4.691","volume":"48","author":"B. Park","year":"2011","unstructured":"Park B., Sano Y.: The competition numbers of Hamming graphs with diameter at most three. J. Korean Math. Soc. 48, 691\u2013702 (2011)","journal-title":"J. Korean Math. Soc."},{"key":"1188_CR13","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1016\/j.aml.2011.04.012","volume":"24","author":"B. Park","year":"2011","unstructured":"Park B., Sano Y.: The competition numbers of ternary Hamming graphs. Appl. Math. Lett. 24, 1608\u20131613 (2011)","journal-title":"Appl. Math. Lett."},{"key":"1188_CR14","doi-asserted-by":"crossref","unstructured":"Roberts, F.S.: Food webs, competition graphs, and the boxicity of ecological phase space. In: Alavi, Y., Lick, D. (eds.) Theory and applications of graphs. Proceedings of the International Conference, Western Michigan University, Kalamazoo, Michigan, 1976. Lecture Notes in Mathematics, vol. 642, pp. 477\u2013490. Springer, New York (1978)","DOI":"10.1007\/BFb0070404"},{"key":"1188_CR15","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. Discret. Appl. Math. 10, 93\u2013109 (1985)","journal-title":"Discret. Appl. Math."},{"key":"1188_CR16","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0166-218X(83)90087-2","volume":"6","author":"F.S. Roberts","year":"1983","unstructured":"Roberts F.S., Steif J.E.: A characterization of competition graphs of arbitrary digraphs. Discret. Appl. Math. 6, 323\u2013326 (1983)","journal-title":"Discret. Appl. Math."},{"key":"1188_CR17","first-page":"211","volume":"198","author":"Y. Sano","year":"2009","unstructured":"Sano Y.: The competition numbers of regular polyhedra. Congr. Numer. 198, 211\u2013219 (2009)","journal-title":"Congr. Numer."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1188-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1188-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1188-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T15:35:56Z","timestamp":1561736156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1188-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,12]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1188"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1188-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,12]]}}}