{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T04:24:13Z","timestamp":1781065453585,"version":"3.54.1"},"reference-count":6,"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)90111-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"537-541","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["The number of spanning trees of a complete multipartite graph"],"prefix":"10.1016","volume":"197-198","author":[{"given":"Richard P.","family":"Lewis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90111-5_BIB1","doi-asserted-by":"crossref","first-page":"535","DOI":"10.4153\/CJM-1960-047-1","article-title":"The enumeration of point labelled chromatic graphs and tress","volume":"12","author":"Austin","year":"1960","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(99)90111-5_BIB2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0097-3165(86)90004-X","article-title":"Bijections for Cayley trees, spanning trees and their q-analogues","volume":"42","author":"Eeciolu","year":"1986","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/S0012-365X(99)90111-5_BIB3","first-page":"225","article-title":"A bijection for spanning trees of complete multipartite graphs","volume":"100","author":"Eeciolu","year":"1994"},{"issue":"1","key":"10.1016\/S0012-365X(99)90111-5_BIB4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01191204","article-title":"Spanning trees of extended graphs","volume":"12","author":"Kelmans","year":"1992","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(99)90111-5_BIB5","first-page":"901","article-title":"Random polygons determined by random lines in a plane","volume":"52","author":"Miles","year":"1964"},{"key":"10.1016\/S0012-365X(99)90111-5_BIB6","first-page":"742","article-title":"Neuer Beweis eines Satzes \u00fcber Permutationen","volume":"27","author":"Pr\u00fcfer","year":"1918","journal-title":"Arch. Math. Phys."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99901115?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99901115?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:57Z","timestamp":1553214117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99901115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":6,"alternative-id":["S0012365X99901115"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90111-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}