{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:43:12Z","timestamp":1776296592444,"version":"3.50.1"},"reference-count":41,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4672,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004084","name":"Korea Science and Engineering Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["BSRI-96-1432"],"award-info":[{"award-number":["BSRI-96-1432"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1016\/s0166-218x(00)00214-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:11:15Z","timestamp":1027591875000},"page":"115-127","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":57,"title":["The m-step competition graph of a digraph"],"prefix":"10.1016","volume":"105","author":[{"given":"Han Hyuk","family":"Cho","sequence":"first","affiliation":[]},{"given":"Suh-Ryung","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Yunsun","family":"Nam","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00214-6_BIB1","first-page":"97","article-title":"New classes of p-competition graphs and \u03c6-tolerance competition graphs","volume":"100","author":"Anderson","year":"1994","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB2","first-page":"145","article-title":"On the double competition number of a bipartite graph","volume":"117","author":"Bak","year":"1996","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB4","first-page":"151","article-title":"Cliques and niche graphs","volume":"76","author":"Bowser","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0166-218X(91)90036-V","article-title":"Some recent results on niche graphs","volume":"30","author":"Bowser","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB6","series-title":"Combinatorial Matrix Theory","author":"Brualdi","year":"1991"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB7","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(00)00214-6_BIB8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0024-3795(81)90172-5","article-title":"Primes in the semigroup of Boolean matrices","volume":"37","author":"de Caen","year":"1981","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0024-3795(93)90221-9","article-title":"Prime Boolean matrices and factorizations","volume":"190","author":"Cho","year":"1993","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB10","first-page":"43","article-title":"A sufficient condition for a tree belonging to T(2,2,n)","volume":"123","author":"Cho","year":"1997","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB11","unstructured":"H.H. Cho, S-R. Kim, Y. Nam, On the connected triangle-free graphs whose 2-step competition numbers are two, submitted."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB12","series-title":"Interval graphs and food webs: a finding and a problem, Document 17696-PR, RAND Corp.","author":"Cohen","year":"1968"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB13","unstructured":"J.E. Cohen, Food Webs and Niche Space, Princeton Univ. Press, Princeton, NJ, 1978."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB14","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(00)00214-6_BIB15","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0095-8956(74)90074-4","article-title":"Characterization of n-path graphs and of graphs having nth root","volume":"16","author":"Escalante","year":"1974","journal-title":"J. Combinat. Theory Ser. B"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB16","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(00)00214-6_BIB17","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/rsa.3240010205","article-title":"Competition graphs and clique dimensions","volume":"1","author":"F\u00fcredi","year":"1990","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(84)90123-9","article-title":"Inverting graphs of rectangular matrices","volume":"8","author":"Greenberg","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB19","first-page":"223","article-title":"Semiring rank: Boolean rank and nonnegative rank factorizations","volume":"8","author":"Gregory","year":"1983","journal-title":"J. Combin. Information System Sci."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB20","doi-asserted-by":"crossref","unstructured":"G. Issak, S-R. Kim, T. McKee, F.R. McMorris, F.S. Roberts, 2-competition graphs, SIAM J. Discrete Math. 5 (1992) 539\u2013144.","DOI":"10.1137\/0405042"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB21","first-page":"17","article-title":"Some remarks on the double competition number of a graph","volume":"60","author":"Jones","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB22","unstructured":"S-R. Kim, Competition graphs and scientific laws for food webs and other systems, Ph.D. Thesis, Rutgers University, 1988."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB23","doi-asserted-by":"crossref","unstructured":"S-R. Kim, The competition number and its variants, In: J. Gimbel, J.W. Kennedy, L.V. Quintas (Eds.), Quo Vadis, Graph Theory?, Annals of Discrete Mathematics, Vol. 55, North-Holland, Amsterdam, Netherlands, 1993, pp. 313\u2013326.","DOI":"10.1016\/S0167-5060(08)70396-0"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB24","article-title":"On the inequality dk(G)\u2a7d k(G)+1, Ars Combin.","volume":"1999","author":"Kim","journal-title":"51"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB25","first-page":"302","article-title":"On 101-clear (0,1) matrices and the double competition number of bipartite graphs","volume":"17","author":"Kim","year":"1992","journal-title":"J. Combin. Information System Sci."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB26","first-page":"167","article-title":"p-competition numbers","volume":"46","author":"Kim","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB27","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0024-3795(94)00060-Q","article-title":"p-competition graphs","volume":"217","author":"Kim","year":"1995","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB28","unstructured":"L. Langley, J.R. Lundgren, P.A. McKenna, S.K. Merz, C.W. Rasmussen, The p-competition graphs of strongly connected and hamiltonian digraphs, mimeographed, Department of Mathematics, University of Colorado, Denver, 1995."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB29","doi-asserted-by":"crossref","unstructured":"J.R. Lundgren, Food webs, competition graphs, competition-common enemy graphs, and niche graphs, In: F.S. Roberts (Ed.), Applications of Combinatorics and Graph Theory to the Biological and Social Sciences, IMH Volumes in Mathematics and its Application, Vol. 17, Springer, New York, 1989, pp. 221\u2013243.","DOI":"10.1007\/978-1-4684-6381-1_9"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB30","unstructured":"J.R. Lundgren, J.S. Maybee, Food webs with interval competition graphs, In: Graphs and Applications: Proceedings of the First Colorado Symposium of Graph Theory, eds., F. Harary and J.S. Maybee, Wiley, New York, 1984, pp. 245\u2013256."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB31","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0024-3795(94)00227-5","article-title":"Chromatic numbers of competition graphs","volume":"217","author":"Lundgren","year":"1995","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB32","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0012-365X(93)90122-A","article-title":"Two-step graphs of trees","volume":"119","author":"Lundgren","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB33","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. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB34","unstructured":"A. Raychaudhuri, F.S. Roberts, Generalized competition graphs and their applications, in: P. Brucher, R. Pauly (Eds.), Methods of Operations Research, Vol. 47, Anton Hain, Konigstein, West Germany, 1985, pp. 295\u2013311."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB35","doi-asserted-by":"crossref","unstructured":"F.S. Roberts, Food webs, competition graphs, and the boxicity of ecological phase space, In: Y. Alavi, D. Lick (Eds.), Theory and Applications of Graphs, Springer, New York, 1978, pp. 477\u2013490.","DOI":"10.1007\/BFb0070404"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB36","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."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB37","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0166-218X(90)90007-Y","article-title":"The double competition number of some triangle-free graphs","volume":"28","author":"Seager","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB38","first-page":"149","article-title":"Niche graph properties of trees","volume":"81","author":"Seager","year":"1991","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB39","first-page":"205","article-title":"Relaxations of niche graphs","volume":"96","author":"Seager","year":"1993","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(00)00214-6_BIB40","doi-asserted-by":"crossref","unstructured":"G. Sugihara, Graph theory, homology, and food webs, In: S.A. Levin (Ed.), Population Biology, Proceedings of the Symposium on Applied Mathematics, Vol. 30, Amer. Math. Soc. Providence, RI, 1983, pp. 83\u2013101.","DOI":"10.1090\/psapm\/030\/738641"},{"key":"10.1016\/S0166-218X(00)00214-6_BIB41","unstructured":"C. Wang, Competition graphs, threshold graphs and threshold Boolean functions, Ph.D. Thesis, Rutgers University, 1991."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002146?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002146?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:56:51Z","timestamp":1759060611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":41,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0166218X00002146"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00214-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The m-step competition graph of a digraph","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(00)00214-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}