{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:19:27Z","timestamp":1775578767009,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":8174,"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":[[1991,3]]},"DOI":"10.1016\/0012-365x(91)90061-6","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:41:28Z","timestamp":1034293288000},"page":"93-104","source":"Crossref","is-referenced-by-count":11,"title":["Trees with 1-factors and oriented trees"],"prefix":"10.1016","volume":"88","author":[{"given":"Rodica","family":"Simion","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90061-6_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(91)90061-6_BIB2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(72)90088-X","article-title":"A graph polynomial and its applications","volume":"3","author":"Clarke","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(91)90061-6_BIB3","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1090\/S0002-9904-1948-09098-X","article-title":"Distinct representatives of subsets","volume":"54","author":"Hall","year":"1948","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(91)90061-6_BIB4","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(91)90061-6_BIB5","series-title":"Graphical Enumeration","author":"Harary","year":"1973"},{"key":"10.1016\/0012-365X(91)90061-6_BIB6","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1017\/S1446788700016190","article-title":"Twenty step algorithm for determining the asymptotic number of trees of various species","volume":"20","author":"Harary","year":"1970","journal-title":"J. Austral. Math. Soc."},{"key":"10.1016\/0012-365X(91)90061-6_BIB7","first-page":"116","article-title":"Graphen und Matrizen","volume":"38","author":"K\u00f6nig","year":"1931","journal-title":"Mat. Fiz. Lapok"},{"key":"10.1016\/0012-365X(91)90061-6_BIB8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(72)90083-0","article-title":"The parity of the number of 1-factors of a graph","volume":"2","author":"Little","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(91)90061-6_BIB9","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/0012-365X(91)90061-6_BIB10","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1215\/S0012-7094-55-02268-7","article-title":"Graphs and matching theorems","volume":"22","author":"Ore","year":"1955","journal-title":"Duke Math. J."},{"key":"10.1016\/0012-365X(91)90061-6_BIB11","first-page":"147","article-title":"Trees with 1-factors: degree distribution","volume":"45","author":"Simion","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(91)90061-6_BIB12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorization of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(91)90061-6_BIB13","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","article-title":"The factors of graphs","volume":"4","author":"Tutte","year":"1952","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(91)90061-6_BIB14","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","article-title":"A short proof of the factor theorem for finite graphs","volume":"6","author":"Tutte","year":"1954","journal-title":"Canad. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X91900616?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X91900616?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T11:54:59Z","timestamp":1554983699000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X91900616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["0012365X91900616"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90061-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}