{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T12:40:36Z","timestamp":1698410436523},"reference-count":9,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":4237,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1995,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A tree is even if its edges can be colored in two colors so that the monochromatic subgraphs are isomorphic. All even trees of maximum degree 3 in which no two vertices of degrees 1 or 3 are adjacent are determined. It is also shown that, for every <jats:italic>n<\/jats:italic>, there are only finitely many trees of maximum degree 3 and with <jats:italic>n<\/jats:italic> vertices of degree 3 that are not even. \u00a9 1995 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190190206","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T13:58:33Z","timestamp":1180187913000},"page":"187-199","source":"Crossref","is-referenced-by-count":2,"title":["Isomorphic factorizations of trees"],"prefix":"10.1002","volume":"19","author":[{"given":"Katherine","family":"Heinrich","sequence":"first","affiliation":[]},{"given":"Peter","family":"Horak","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"117","article-title":"A note on the decomposition of trees into isomorphic subtrees","volume":"12","author":"Alon N.","year":"1981","journal-title":"Ars Combinat."},{"key":"e_1_2_1_3_2","first-page":"123","article-title":"More on the decomposition of trees into isomorphic subtrees","volume":"14","author":"Alon N.","year":"1982","journal-title":"Ars Combinat."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90350-3"},{"key":"e_1_2_1_5_2","volume-title":"Decompositions of Graphs","author":"Bos\u00e1k J.","year":"1990"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080404"},{"key":"e_1_2_1_7_2","first-page":"119","article-title":"Decomposition of trees into isomorphic subtrees","volume":"9","author":"Caro Y.","year":"1980","journal-title":"Ars Combinat."},{"key":"e_1_2_1_8_2","unstructured":"R. L.GrahamandR. W.Robinson Isomorphic factorizations IX. Manuscript."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579217"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190090105"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190190206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190190206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T14:17:37Z","timestamp":1698329857000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190190206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["10.1002\/jgt.3190190206"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190190206","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}