{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:58:00Z","timestamp":1760245080321},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T00:00:00Z","timestamp":1273190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10878-010-9331-9","type":"journal-article","created":{"date-parts":[[2010,5,6]],"date-time":"2010-05-06T21:08:32Z","timestamp":1273180112000},"page":"1-8","source":"Crossref","is-referenced-by-count":6,"title":["The competition number of a graph with\u00a0exactly\u00a0two\u00a0holes"],"prefix":"10.1007","volume":"23","author":[{"given":"Bo-Jr","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard J.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,7]]},"reference":[{"key":"9331_CR1","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.disc.2004.12.016","volume":"303","author":"HH Cho","year":"2005","unstructured":"Cho HH, Kim S-R (2005) The competition number of a graph having exactly one hole. Discrete Math 303:32\u201341","journal-title":"Discrete Math"},{"key":"9331_CR2","unstructured":"Cohen JE (1968) Interval graphs and food webs: a finding and a problem. RAND Corporation Document 17696-PR, Santa Monica, CA"},{"key":"9331_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"GA Dirac","year":"1961","unstructured":"Dirac GA (1961) On rigid circuit graphs. Abh Math Semin Univ Hamb 25:71\u201376","journal-title":"Abh Math Semin Univ Hamb"},{"key":"9331_CR4","first-page":"33","volume":"5","author":"F Harary","year":"1990","unstructured":"Harary F, Kim S-R, Roberts FS (1990) Extremal competition numbers as a generalization of Turan\u2019s theorem. J Ramanujan Math Soc 5:33\u201343","journal-title":"J Ramanujan Math Soc"},{"key":"9331_CR5","series-title":"Annals of discrete mathematics","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0167-5060(08)70396-0","volume-title":"Quo Vadis, graph theory?","author":"S-R Kim","year":"1993","unstructured":"Kim S-R (1993) The competition number and its variants. In: Gimbel J, Kennedy JW, Quintas LV (eds) Quo Vadis, graph theory? Annals of discrete mathematics, vol 55. North-Holland, Amsterdam, pp 313\u2013326"},{"key":"9331_CR6","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.4134\/JKMS.2005.42.6.1251","volume":"42","author":"S-R Kim","year":"2005","unstructured":"Kim S-R (2005) Graphs with one hole and competition number one. J Korean Math Soc 42:1251\u20131264","journal-title":"J Korean Math Soc"},{"key":"9331_CR7","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 FS (1997) Competition numbers of graphs with a small number of triangles. Discrete Appl Math 78:153\u2013162","journal-title":"Discrete Appl Math"},{"key":"9331_CR8","unstructured":"Li B-J (2008) Topics in intersection graphs. PhD thesis, Department of Mathematics, National Taiwan University"},{"key":"9331_CR9","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1016\/j.dam.2008.11.004","volume":"157","author":"B-J Li","year":"2009","unstructured":"Li B-J, Chang GJ (2009) The competition number of a graph with exactly h holes, all of which are independent. Discrete Appl Math 157:1337\u20131341","journal-title":"Discrete Appl Math"},{"key":"9331_CR10","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/0603043","volume":"3","author":"RJ Opsut","year":"1982","unstructured":"Opsut RJ (1982) On the computation of the competition number of a graph. SIAM J Algebr Discrete Math 3:420\u2013428","journal-title":"SIAM J Algebr Discrete Math"},{"key":"9331_CR11","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/BFb0070404","volume-title":"Theory and applications of graphs","author":"FS Roberts","year":"1978","unstructured":"Roberts FS (1978) Food webs, competition graphs, and the boxicity of ecological phase space. In: Alavi Y, Lick D (eds) Theory and applications of graphs. Springer, New York, pp 477\u2013490"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9331-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9331-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9331-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9331-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,7]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9331"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9331-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,7]]}}}