{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T02:20:58Z","timestamp":1648952458579},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0012-365x(93)90335-q","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"197-213","source":"Crossref","is-referenced-by-count":3,"title":["On biclique partitions of the complete graph"],"prefix":"10.1016","volume":"117","author":[{"given":"Bryan L.","family":"Shader","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90335-Q_BIB1","series-title":"Graph Theory and Theoretical Physics","first-page":"139","article-title":"The decomposition of complete graphs into planar subgraphs","author":"Beineke","year":"1967"},{"key":"10.1016\/0012-365X(93)90335-Q_BIB2","unstructured":"D. de Caen, The rank of tournament matrices over arbitrary fields, Amer. Math. Monthly, to appear."},{"key":"10.1016\/0012-365X(93)90335-Q_BIB3","first-page":"139","article-title":"On the decomposition of a directed graph into complete bipartite subgraphs","volume":"23B","author":"de Caen","year":"1987","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(93)90335-Q_BIB4","author":"de Caen","year":"1989","journal-title":"Minimum biclique partitions of the complete multigraph"},{"key":"10.1016\/0012-365X(93)90335-Q_BIB5","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/0402005","article-title":"Impossibility of decomposing the complete graph on n points into n\u22121 isomorphic complete bipartite graphs","volume":"2","author":"de Caen","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0012-365X(93)90335-Q_BIB6","doi-asserted-by":"crossref","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","article-title":"On the addressing problem for loop switching","volume":"50","author":"Graham","year":"1971","journal-title":"Bell Systs. Tech. J."},{"key":"10.1016\/0012-365X(93)90335-Q_BIB7","series-title":"Graph Theory and Applications","first-page":"99","article-title":"On embedding graphs in squashed cubes","volume":"Vol. 303","author":"Graham","year":"1973"},{"key":"10.1016\/0012-365X(93)90335-Q_BIB8","first-page":"71","article-title":"Singular tournament matrices","volume":"72","author":"Katzenberger","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(93)90335-Q_BIB9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02476378","article-title":"On dominance relations and the structure of animal societies: III. The condition for a score structure","volume":"15","author":"Landau","year":"1953","journal-title":"Bull. Math. Biophys."},{"key":"10.1016\/0012-365X(93)90335-Q_BIB10","unstructured":"T.S. Michael, personal communication."},{"key":"10.1016\/0012-365X(93)90335-Q_BIB11","series-title":"Topics in Tournaments","author":"Moon","year":"1968"},{"key":"10.1016\/0012-365X(93)90335-Q_BIB12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(84)90174-2","article-title":"A new proof of a theorem of Graham and Pollak","volume":"49","author":"Peck","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90335-Q_BIB13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/jgt.3190100208","article-title":"Applying a proof of Tverberg to complete bipartite decompositions of digraphs and multigraphs","volume":"10","author":"Pritikin","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(93)90335-Q_BIB14","series-title":"Selected Topics in Graph Theory","first-page":"385","author":"Reid","year":"1978"},{"key":"10.1016\/0012-365X(93)90335-Q_BIB15","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/jgt.3190060414","article-title":"On the decomposition of Kn into complete bipartite graphs","volume":"6","author":"Tverberg","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(93)90335-Q_BIB16","doi-asserted-by":"crossref","first-page":"568","DOI":"10.2307\/2323163","article-title":"How does a complete graph split into bipartite graphs and how are neighbourly cubes arranged?","volume":"92","author":"Zaks","year":"1985","journal-title":"Amer. Math. Monthly"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390335Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390335Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:54:28Z","timestamp":1555134868000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390335Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["0012365X9390335Q"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90335-q","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}