{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:52Z","timestamp":1761620812113},"reference-count":78,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985,1]]},"DOI":"10.1016\/0166-218x(85)90061-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"93-109","source":"Crossref","is-referenced-by-count":49,"title":["Applications of edge coverings by cliques"],"prefix":"10.1016","volume":"10","author":[{"given":"Fred S.","family":"Roberts","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90061-7_BIB1","first-page":"185","article-title":"Some queries on the periodicity and convergence of a graph","author":"Acharya","year":"1980","journal-title":"Prof. P.L. Bhatnagar Commemoration Volume of Nat. Acad. Sci. (India), Ser. A"},{"key":"10.1016\/0166-218X(85)90061-7_BIB2","article-title":"Open neighborhood graphs","author":"Acharya","year":"1973","journal-title":"Research Report of the Indian Institute of Technology"},{"key":"10.1016\/0166-218X(85)90061-7_BIB3","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(85)90061-7_BIB4","series-title":"Status Characteristics and Social Interaction","author":"Berger","year":"1977"},{"key":"10.1016\/0166-218X(85)90061-7_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(81)90016-9","article-title":"Graphs which, with their complements, have certain clique covering numbers","volume":"34","author":"Brigham","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0012-365X(83)90054-7","article-title":"On clique covers and independence numbers of graphs","volume":"44","author":"Brigham","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB7","series-title":"Upper bounds on the edge clique cover number of a graph","author":"Brigham","year":"1983"},{"key":"10.1016\/0166-218X(85)90061-7_BIB8","series-title":"Proceedings of the Xth Australian Conference on Combinatorial Mathematics","article-title":"Clique covering numbers of cubic graphs","author":"Cacetta","year":"1982"},{"key":"10.1016\/0166-218X(85)90061-7_BIB9","first-page":"201","article-title":"On clique covering numbers of regular graphs","volume":"15","author":"Cacetta","year":"1983","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0166-218X(85)90061-7_BIB10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1037\/h0046049","article-title":"Structural balance: A generalization of Heider's idea","volume":"63","author":"Cartwright","year":"1956","journal-title":"Psych. Rev."},{"key":"10.1016\/0166-218X(85)90061-7_BIB11","first-page":"289","article-title":"Line-clique cover number of a graph","volume":"41","author":"Choudom","year":"1975"},{"key":"10.1016\/0166-218X(85)90061-7_BIB12","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\/0166-218X(85)90061-7_BIB13","first-page":"4533","article-title":"Food webs and the dimensionality of trophic niche space","volume":"74","author":"Cohen","year":"1977"},{"key":"10.1016\/0166-218X(85)90061-7_BIB14","series-title":"Food Webs and Niche Space","author":"Cohen","year":"1978"},{"key":"10.1016\/0166-218X(85)90061-7_BIB15","series-title":"Current Trends in Food Web Theory","article-title":"Recent progress and problems in food web theory","author":"Cohen","year":"1983"},{"key":"10.1016\/0166-218X(85)90061-7_BIB16","article-title":"Graphs associated with (0, 1)-arrays","author":"Cook","year":"1970","journal-title":"University of Iowa Tech. Rept. 28"},{"key":"10.1016\/0166-218X(85)90061-7_BIB17","article-title":"Clique coverings of complements of paths and cycles","author":"De Caen","year":"1984","journal-title":"Annals Discrete Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB18","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 Applied Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB19","doi-asserted-by":"crossref","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","article-title":"The representation of a graph by set intersections","volume":"18","author":"Erd\u00f6s","year":"1966","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB20","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/BF02992818","article-title":"Ueber iterierte clique graphen","volume":"39","author":"Escalante","year":"1973","journal-title":"Abh. Math. Sem. Hamburg"},{"key":"10.1016\/0166-218X(85)90061-7_BIB21","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. Combin. Theory (B)"},{"key":"10.1016\/0166-218X(85)90061-7_BIB22","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1146\/annurev.es.03.110172.002235","article-title":"Cladistic methodology: A discussion of the theoretical basis for the induction of evolutionary history","volume":"3","author":"Estabrook","year":"1972","journal-title":"Ann. Rev. Ecol. Systems"},{"key":"10.1016\/0166-218X(85)90061-7_BIB23","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF00276095","article-title":"When is one estimate of evolutionary relationship a refinement of another?","volume":"10","author":"Estabrook","year":"1980","journal-title":"J. Math. Biology"},{"key":"10.1016\/0166-218X(85)90061-7_BIB24","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(80)90260-5","article-title":"Consanguinity graphs","volume":"32","author":"Florence","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB25","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","article-title":"The complexity of near-optimal graph coloring","volume":"23","author":"Garey","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(85)90061-7_BIB26","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(85)90061-7_BIB27","series-title":"Computer Assisted Analysis and Model Simplification","first-page":"497","article-title":"Measuring complementarity and qualitative determinacy in matricial forms","author":"Greenberg","year":"1981"},{"key":"10.1016\/0166-218X(85)90061-7_BIB28","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\/0166-218X(85)90061-7_BIB29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/0602025","article-title":"Graph theoretic methods for the qualitative analysis of rectangular matrices","volume":"2","author":"Greenberg","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(85)90061-7_BIB30","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1137\/0604007","article-title":"Rectangular matrices and signed graphs","volume":"4","author":"Greenberg","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(85)90061-7_BIB31","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 Applied Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB32","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0605022","article-title":"Inverting signed graphs","volume":"5","author":"Greenberg","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(85)90061-7_BIB33","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0012-365X(82)90085-1","article-title":"On a clique covering problem of Orlin","volume":"41","author":"Gregory","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB34","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/S0021-9800(68)80055-9","article-title":"A partial characterization of clique graphs","volume":"5","author":"Hamelink","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(85)90061-7_BIB35","first-page":"143","article-title":"On the notion of balance of a signed graph","volume":"2","author":"Harary","year":"1954","journal-title":"Michigan Math. J."},{"key":"10.1016\/0166-218X(85)90061-7_BIB36","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(85)90061-7_BIB37","series-title":"Proof Techniques in Graph Theory","first-page":"71","article-title":"On the intersection number of a graph","author":"Harary","year":"1969"},{"key":"10.1016\/0166-218X(85)90061-7_BIB38","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0165-4896(80)90010-4","article-title":"A simple algorithm to detect balance in signed graphs","volume":"1","author":"Harary","year":"1980","journal-title":"Math. Soc. Sci."},{"key":"10.1016\/0166-218X(85)90061-7_BIB39","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(85)90061-7_BIB40","first-page":"544","article-title":"Computation of masks for use in determining keyword conflict","volume":"16","author":"Kellerman","year":"1973","journal-title":"IBM Tech. Disclosure Bull."},{"key":"10.1016\/0166-218X(85)90061-7_BIB41","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/359340.359346","article-title":"Covering edges by cliques with regard to keyword conflicts and intersection graphs","volume":"21","author":"Kou","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(85)90061-7_BIB42","series-title":"Proceedings of the Colloquium held at Tihany","first-page":"231","article-title":"On covering of graphs","author":"Lov\u00e1sz","year":"1968"},{"key":"10.1016\/0166-218X(85)90061-7_BIB43","series-title":"A characterization of consanguinity graphs","author":"Lundgren","year":"1983"},{"key":"10.1016\/0166-218X(85)90061-7_BIB44","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0166-218X(83)90086-0","article-title":"A characterization of graphs of competition number m","volume":"6","author":"Lundgren","year":"1983","journal-title":"Discrete Applied Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB45","first-page":"189","article-title":"A characterization of upper bound graphs","volume":"40","author":"Lundgren","year":"1983","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0166-218X(85)90061-7_BIB46","doi-asserted-by":"crossref","first-page":"303","DOI":"10.4064\/fm-33-1-303-307","article-title":"Sur deux propri\u00e9t\u00e9s des classes d'ensembles","volume":"33","author":"Marczewski","year":"1945","journal-title":"Fund. Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB47","series-title":"Partition intersection graphs","author":"McMorris","year":"1983"},{"key":"10.1016\/0166-218X(85)90061-7_BIB48","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0012-365X(83)90199-1","article-title":"Some uniqueness results for upper bound graphs","volume":"44","author":"McMorris","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB49","first-page":"134","article-title":"Bound graphs of a partially ordered set","volume":"7","author":"McMorris","year":"1982","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"10.1016\/0166-218X(85)90061-7_BIB50","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/S0021-9800(67)80030-9","article-title":"The square root of a graph","volume":"2","author":"Mukhopadhyay","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(85)90061-7_BIB51","article-title":"Upper bound graphs of partially ordered sets","author":"Myers","year":"1982"},{"key":"10.1016\/0166-218X(85)90061-7_BIB52","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\/0166-218X(85)90061-7_BIB53","series-title":"The Theory and Applications of Graphs","first-page":"479","article-title":"On the fleet maintenance, mobile radio frequency, task assignment, and traffic phasing problems","author":"Opsut","year":"1981"},{"key":"10.1016\/0166-218X(85)90061-7_BIB54","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1002\/net.3230130302","article-title":"I-colorings, I-phasings, and I-intersection assignments for graphs, and their applications","volume":"13","author":"Opsut","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0166-218X(85)90061-7_BIB55","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/net.3230130301","article-title":"Optimal I-intersection assignments for graphs: A linear programming approach","volume":"13","author":"Opsut","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0166-218X(85)90061-7_BIB56","first-page":"406","article-title":"Contentment in graph theory: Covering graphs with cliques","volume":"80","author":"Orlin","year":"1977"},{"key":"10.1016\/0166-218X(85)90061-7_BIB57","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0166-218X(81)90007-X","article-title":"Complexity of representation of graphs by set systems","volume":"3","author":"Poljak","year":"1981","journal-title":"Discrete Applied Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB58","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0604029","article-title":"Determinacy in linear systems and networks","volume":"4","author":"Provan","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(85)90061-7_BIB59","article-title":"Correlation and determinacy in network models","author":"Provan","year":"1980"},{"key":"10.1016\/0166-218X(85)90061-7_BIB60","series-title":"Proceedings of the Xth Australian Conference on Combinatorial Mathematics","article-title":"Clique coverings of graphs \u2014 a survey","author":"Pullman","year":"1982"},{"key":"10.1016\/0166-218X(85)90061-7_BIB61","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/0213005","article-title":"Clique coverings of graphs IV: Algorithms","volume":"13","author":"Pullman","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(85)90061-7_BIB62","first-page":"795","article-title":"Clique coverings of graphs III: Clique coverings of regular graphs","volume":"29","author":"Pullman","year":"1980","journal-title":"Congressus Numerantlum"},{"key":"10.1016\/0166-218X(85)90061-7_BIB63","first-page":"177","article-title":"Clique coverings of graphs I: Clique partitions of regular graphs","volume":"19","author":"Pullman","year":"1981","journal-title":"Utilitus Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB64","first-page":"207","article-title":"Clique coverings of graphs II: Complements of cliques","volume":"19","author":"Pullman","year":"1981","journal-title":"Utilitas Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB65","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1017\/S0004972700005414","article-title":"Clique coverings of graphs V: Maximal-clique partitions","volume":"25","author":"Pullman","year":"1982","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/0166-218X(85)90061-7_BIB66","series-title":"Discrete Mathematical Models, with Applications to Social, Biological, and Environmental Problems","author":"Roberts","year":"1976"},{"key":"10.1016\/0166-218X(85)90061-7_BIB67","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\/0166-218X(85)90061-7_BIB68","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970401","article-title":"Graph Theory and its Applications to Problems of Society","author":"Roberts","year":"1978"},{"key":"10.1016\/0166-218X(85)90061-7_BIB69","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1111\/j.1749-6632.1979.tb32824.x","article-title":"On the mobile radio frequency assignment problem and the traffic light phasing problem","volume":"319","author":"Roberts","year":"1979","journal-title":"Annals N.Y. Acad. Sci."},{"key":"10.1016\/0166-218X(85)90061-7_BIB70","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0095-8956(71)90070-0","article-title":"A characterization of clique graphs","volume":"10B","author":"Roberts","year":"1971","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(85)90061-7_BIB71","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 Applied Math."},{"key":"10.1016\/0166-218X(85)90061-7_BIB72","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","article-title":"The zero-error capacity of a noisy channel","volume":"2","author":"Shannon","year":"1956","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/0166-218X(85)90061-7_BIB73","doi-asserted-by":"crossref","first-page":"441","DOI":"10.6028\/jres.080B.049","article-title":"A note on pseudointersection graphs","volume":"80B","author":"Slater","year":"1976","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0166-218X(85)90061-7_BIB74","article-title":"Frame dimension, generalized competition graphs, and forbidden sublist characterizations","author":"Steif","year":"1982"},{"key":"10.1016\/0166-218X(85)90061-7_BIB75","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0041-1647(68)90016-6","article-title":"Scheduling of traffic lights \u2014 a new approach","volume":"2","author":"Stoffers","year":"1968","journal-title":"Transportation Research"},{"key":"10.1016\/0166-218X(85)90061-7_BIB76","first-page":"389","article-title":"Bounds on Nordhaus-Gaddum type bounds for clique cover numbers","volume":"40","author":"Taylor","year":"1983","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0166-218X(85)90061-7_BIB77","series-title":"Balance in Small Groups","author":"Taylor","year":"1970"},{"key":"10.1016\/0166-218X(85)90061-7_BIB78","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02579286","article-title":"Asymptotic values of clique partition numbers","volume":"2","author":"Wallis","year":"1982","journal-title":"Combinatorica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900617?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900617?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T08:52:40Z","timestamp":1622105560000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":78,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0166218X85900617"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90061-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}