{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T01:00:21Z","timestamp":1720054821570},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"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":5280,"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":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90149-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"791-797","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["\u0160k-factorization of symmetric complete tripartite digraphs"],"prefix":"10.1016","volume":"197-198","author":[{"given":"Kazuhiko","family":"Ushio","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90149-8_BIB1","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/S0012-365X(99)90149-8_BIB2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0012-365X(97)00264-1","article-title":"K1, p2-factorization of complete bipartite graphs","volume":"187","author":"Du","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90149-8_BIB3","unstructured":"B. Du, P3-factorization of complete bipartite symmetric digraphs, submitted for publication."},{"key":"10.1016\/S0012-365X(99)90149-8_BIB4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01864159","article-title":"Ck-factorization of complete bipartite graphs","volume":"4","author":"Enomoto","year":"1988","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(99)90149-8_BIB5","series-title":"Graph Theory","author":"Harary","year":"1972"},{"key":"10.1016\/S0012-365X(99)90149-8_BIB6","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0012-365X(97)00248-3","article-title":"Complete bipartite factorisations by complete bipartite graphs","volume":"167\/168","author":"Martin","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90149-8_BIB7","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1002\/(SICI)1520-6610(1997)5:6<407::AID-JCD2>3.0.CO;2-J","article-title":"Balanced bipartite graphs may be completely star-factored","volume":"5","author":"Martin","year":"1997","journal-title":"J. Combin. Designs"},{"key":"10.1016\/S0012-365X(99)90149-8_BIB8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0012-365X(88)90227-0","article-title":"P3-factorization of complete bipartite graphs","volume":"72","author":"Ushio","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90149-8_BIB9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01788695","article-title":"P3-factorization of complete multipartite graphs","volume":"5","author":"Ushio","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(99)90149-8_BIB10","first-page":"557","article-title":"Cyclic Sk-factorization of complete bipartite graphs","author":"Ushio","year":"1991"},{"key":"10.1016\/S0012-365X(99)90149-8_BIB11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0012-365X(93)90408-L","article-title":"G-designs and related designs","volume":"116","author":"Ushio","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90149-8_BIB12","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0012-365X(96)00259-2","article-title":"Star-factorization of symmetric complete bipartite digraphs","volume":"167\/168","author":"Ushio","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90149-8_BIB13","first-page":"221","article-title":"\u010ck-factorization of symmetric complete bipartite and tripartite digraphs","volume":"33","author":"Ushio","year":"1997","journal-title":"J. Fac. Sci. Technol. Kinki Univ."},{"key":"10.1016\/S0012-365X(99)90149-8_BIB14","series-title":"Graph Theory, Combinatorics, Algorithms and Applications","first-page":"823","article-title":"p,q-factorization of symmetric complete bipartite digraphs","author":"Ushio","year":"1998"},{"key":"10.1016\/S0012-365X(99)90149-8_BIB15","article-title":"Cycle-factorization of symmetric complete multipartite digraphs","author":"Ushio","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90149-8_BIB16","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(94)90278-X","article-title":"On K1, k-factorizations of a complete bipartite graph","volume":"126","author":"Wang","year":"1994","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99901498?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99901498?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:21:40Z","timestamp":1553214100000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99901498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":16,"alternative-id":["S0012365X99901498"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90149-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}