{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:07:26Z","timestamp":1773670046951,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5768,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0166-218x(97)00026-7","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"153-162","source":"Crossref","is-referenced-by-count":20,"title":["Competition numbers of graphs with a small number of triangles"],"prefix":"10.1016","volume":"78","author":[{"given":"Suh-Ryung","family":"Kim","sequence":"first","affiliation":[]},{"given":"Fred S.","family":"Roberts","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00026-7_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(97)00026-7_BIB2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(89)90015-2","article-title":"Niche graphs","volume":"23","author":"Cable","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00026-7_BIB3","article-title":"Interval Graphs and Food Webs: A Finding and a Problem","author":"Cohen","year":"1968","journal-title":"RAND Corporation Document 17696-PR"},{"key":"10.1016\/S0166-218X(97)00026-7_BIB4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0166-218X(83)90085-9","article-title":"A characterization of competition graphs","volume":"6","author":"Dutton","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00026-7_BIB5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/jgt.3190160204","article-title":"Niche numbers","volume":"16","author":"Fishburn","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(97)00026-7_BIB6","series-title":"Computer-Assisted Analysis and Model Simplification","first-page":"481","article-title":"Graph-theoretic foundations of computer-assisted analysis","author":"Greenberg","year":"1981"},{"key":"10.1016\/S0166-218X(97)00026-7_BIB7","first-page":"17","article-title":"Some remarks on the double competition number of a graph","volume":"60","author":"Jones","year":"1987"},{"key":"10.1016\/S0166-218X(97)00026-7_BIB8","series-title":"Applications of Combinatorics and Graph Theory in the Biological and Social Sciences","first-page":"221","article-title":"Food webs, competition graphs, competition-common enemy graphs, and niche graphs","volume":"vol. 17","author":"Lundgren","year":"1989"},{"key":"10.1016\/S0166-218X(97)00026-7_BIB9","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/0603043","article-title":"On the computation of the competition number of a graph","volume":"3","author":"Opsut","year":"1982","journal-title":"SIAM J. Algebra Discrete Meth."},{"key":"10.1016\/S0166-218X(97)00026-7_BIB10","first-page":"295","article-title":"Generalized competition graphs and their applications","volume":"Vol. 49","author":"Raychaudhuri","year":"1985"},{"key":"10.1016\/S0166-218X(97)00026-7_BIB11","series-title":"Theory and Applications of Graphs","first-page":"477","article-title":"Food webs, competition graphs, and the boxicity of ecological phase space","author":"Roberts","year":"1978"},{"key":"10.1016\/S0166-218X(97)00026-7_BIB12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0166-218X(83)90087-2","article-title":"A characterization of competition graphs of arbitrary digraphs","volume":"6","author":"Roberts","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00026-7_BIB13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0166-218X(87)90030-8","article-title":"The competition-common enemy graph of a digraph","volume":"17","author":"Scott","year":"1987","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:29:27Z","timestamp":1556130567000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0166218X97000267"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00026-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}