{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:22:24Z","timestamp":1769973744771,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1984,3,1]],"date-time":"1984-03-01T00:00:00Z","timestamp":446947200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1984,3]]},"DOI":"10.1007\/bf02579163","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:16:21Z","timestamp":1174598181000},"page":"111-116","source":"Crossref","is-referenced-by-count":39,"title":["Covering of graphs by complete bipartite subgraphs; Complexity of 0\u20131 matrices"],"prefix":"10.1007","volume":"4","author":[{"given":"Zsolt","family":"Tuza","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579163_CR1","unstructured":"J. C. Bermond, Couverture des arr\u00eates d\u2019un graphe par des graphes bipartis complets,preprint, Univ. de Paris-Sud, Centre d\u2019Orsay, Rapport de Recherche No. 10. (June 1978)."},{"key":"BF02579163_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1017\/S0305004100052063","volume":"79","author":"B. Bollob\u00e1s","year":"1976","unstructured":"B. Bollob\u00e1s, On complete subgraphs of different orders,Math. Proc. Comb. Philos. Soc. 79 (1976), 19\u201324.","journal-title":"Math. Proc. Comb. Philos. Soc."},{"key":"BF02579163_CR3","first-page":"1277","volume":"51","author":"N. G. DeBruijn","year":"1948","unstructured":"N. G. DeBruijn andP. Erd\u0151s. On a combinatorial problem,Nederl. Akad. Wetensch. Proc. 51 (1948), 1277\u20131279.","journal-title":"Nederl. Akad. Wetensch. Proc."},{"key":"BF02579163_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0012-365X(80)90109-0","volume":"30","author":"F. R. K. Chung","year":"1980","unstructured":"F. R. K. Chung, On the coverings of graphs,Discrete Math. 30 (1980), 89\u201393.","journal-title":"Discrete Math."},{"key":"BF02579163_CR5","doi-asserted-by":"crossref","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P. Erd\u0151s","year":"1959","unstructured":"P. Erd\u0151s, Graph theory and probability,Canad. J. Math. 11 (1959) 34\u201338.","journal-title":"Canad. J. Math."},{"key":"BF02579163_CR6","doi-asserted-by":"crossref","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P. Erd\u0151s","year":"1966","unstructured":"P. Erd\u0151s, A. Goodman andL. P\u00f3sa, The representation of graphs by set intersections,Canad. J. Math. 18 (1966), 106\u2013112.","journal-title":"Canad. J. Math."},{"key":"BF02579163_CR7","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"P. Erd\u0151s andG. Szekeres, A combinatorial problem in geometry,Compositio Math. 2 (1935), 463\u2013470.","journal-title":"Compositio Math."},{"key":"BF02579163_CR8","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/0001-8708(78)90005-1","volume":"29","author":"R. L. Graham","year":"1978","unstructured":"R. L. Graham andL. Lov\u00e1sz, Distance matrix polynomials of trees,Advances in Mathematics 29 (1978), 60\u201388.","journal-title":"Advances in Mathematics"},{"key":"BF02579163_CR9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01896127","volume":"34","author":"E. Gy\u0151ri","year":"1979","unstructured":"E. Gy\u0151ri andA. V. Kostochka, On a problem of G. O. H. Katona and T. Tarj\u00e1n,Acta Math. Acad. Sci. Hungar. 34 (1979), 321\u2013327.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"BF02579163_CR10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/jgt.3190010208","volume":"1","author":"F. Harary","year":"1977","unstructured":"F. Harary, D. Hsu andZ. Miller, The biparticity of a graph,J. Graph Theory 1 (1977), 131\u2013133.","journal-title":"J. Graph Theory"},{"key":"BF02579163_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.4064\/cm-6-1-61-65","volume":"6","author":"C. Hylten-Cavallius","year":"1958","unstructured":"C. Hylten-Cavallius, On a combinatorial problem,Colloq. Math. 6 (1958), 59\u201365.","journal-title":"Colloq. Math."},{"key":"BF02579163_CR12","first-page":"23","volume":"2","author":"G. Katona","year":"1967","unstructured":"G. Katona andE. Szemer\u00e9di, On a problem of graph theory,Studia Sci. Math. Hungar. 2 (1967), 23\u201328.","journal-title":"Studia Sci. Math. Hungar."},{"issue":"3","key":"BF02579163_CR13","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02579237","volume":"2","author":"J. Lehel","year":"1982","unstructured":"J. Lehel, Covers in hypergraphs,Combinatorica 2 (3) (1982), 305\u2013309.","journal-title":"Combinatorica"},{"key":"BF02579163_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(82)90040-1","volume":"39","author":"J. Lehel","year":"1982","unstructured":"J. Lehel andZs. Tuza, Triangle-free partial graphs and edge covering theorems,Discrete Math. 39 (1982), 59\u201365.","journal-title":"Discrete Math."},{"key":"BF02579163_CR15","unstructured":"L. Lov\u00e1sz, On covering of graphs, in:Theory of Graphs, (P. Erd\u0151s and G. Katona, eds.),Proc. Coll. at Tihany, Hungary, 1966, Academic Press and Akad\u00e9miai Kiad\u00f3, 231\u2013236."},{"key":"BF02579163_CR16","unstructured":"V. R\u00f6dl, private communication."},{"key":"BF02579163_CR17","first-page":"203","volume":"10","author":"T. G. Tarj\u00e1n","year":"1975","unstructured":"T. G. Tarj\u00e1n, Complexity of lattice-configurations,Studia Sci. Math. Hungar. 10 (1975), 203\u2013211.","journal-title":"Studia Sci. Math. Hungar."},{"key":"BF02579163_CR18","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/jgt.3190060414","volume":"6","author":"H. Tverberg","year":"1982","unstructured":"H. Tverberg, On the decomposition ofK n in complete bipartite graphs,J. Graph Theory 6 (1982), 493\u2013494.","journal-title":"J. Graph Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579163.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579163\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:44:58Z","timestamp":1558197898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["BF02579163"],"URL":"https:\/\/doi.org\/10.1007\/bf02579163","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}