{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:15:36Z","timestamp":1759335336833},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":[[1992,3]]},"DOI":"10.1007\/bf01191204","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T06:10:38Z","timestamp":1108707038000},"page":"45-51","source":"Crossref","is-referenced-by-count":5,"title":["Spanning trees of extended graphs"],"prefix":"10.1007","volume":"12","author":[{"given":"A. K.","family":"Kelmans","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy, andU. S. R. Murty:Graph Theory with Applications, New York: Elsevier, London: MacMillan, 1976."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01896762","volume":"27","author":"A. K. Kelmans","year":"1976","unstructured":"A. K. Kelmans: The number of spanning trees of a graph containing a given forestActa Math. Acad. Sci. Hungar.,27 (1976), 89?95.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"CR3","first-page":"2194","volume":"3","author":"A. K. Kelmans","year":"1965","unstructured":"A. K. Kelmans: The number of trees of a graph I, IIAvtomat. i Telemekh,3, (1965), 2194?2204;2, (1966), 56?65. (English transl. in Automat. Remote Control26 (1965);27 (1966)).","journal-title":"Avtomat. i Telemekh"},{"key":"CR4","first-page":"406","volume-title":"Issledovaniya po Diskretnoy optimizacii","author":"A. K. Kelmans","year":"1976","unstructured":"A. K. Kelmans: Operations on graphs that increase the number of their spanning trees, in: Issledovaniya po Diskretnoy optimizacii, Nauka, Moskva 1976, 406?424. (in Russian, MR 56 #3342)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(76)90102-3","volume":"16","author":"A. K. Kelmans","year":"1976","unstructured":"A. K. Kelmans: Comparison of graphs by their number of spanning trees,Discrete Mathematics 16 (1976), 241?261.","journal-title":"Discrete Mathematics"},{"issue":"B","key":"CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0095-8956(74)90065-3","volume":"16","author":"A. K. Kelmans","year":"1974","unstructured":"A. K. Kelmans, andV. N. Chelnokov: A certain polynomial of a graph and graphs with extremal number of trees,J. Combinatorial Theory, (B)16 (1974), 197?214.","journal-title":"J. Combinatorial Theory"},{"key":"CR7","first-page":"71","volume":"3","author":"Gy. Ol\ufffdh","year":"1968","unstructured":"Gy. Ol\ufffdh: A problem on the number of trees,Studia Sci. Math. Hungar. 3 (1968), 71?80.","journal-title":"Studia Sci. Math. Hungar."},{"key":"CR8","first-page":"142","volume":"27","author":"A. Pr\ufffdfer","year":"1918","unstructured":"A. Pr\ufffdfer: Neuer Beweis eines Satzes \ufffdber Permutationen,Archiv f\ufffdr Math. u. Phys. 27 (1918), 142?144.","journal-title":"Archiv f\ufffdr Math. u. Phys."},{"key":"CR9","first-page":"77","volume":"16","author":"A. R\ufffdnyi","year":"1966","unstructured":"A. R\ufffdnyi: \ufffdj m\ufffddszerek \ufffds eredm\ufffdnyek a kombinatorikus anal\ufffdzisben I,Magyar Tud. Akad. Mat. Fiz. Oszt. K\ufffdzl. 16 (1966), 77?105.","journal-title":"Magyar Tud. Akad. Mat. Fiz. Oszt. K\ufffdzl."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191204.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01191204\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01191204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T09:08:30Z","timestamp":1556615310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01191204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["BF01191204"],"URL":"https:\/\/doi.org\/10.1007\/bf01191204","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}