{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T05:15:32Z","timestamp":1721625332526},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T00:00:00Z","timestamp":1201824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s00373-007-0766-4","type":"journal-article","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T06:24:51Z","timestamp":1202970291000},"page":"19-28","source":"Crossref","is-referenced-by-count":2,"title":["On Planar Graphs Arbitrarily Decomposable into Closed Trails"],"prefix":"10.1007","volume":"24","author":[{"given":"Mirko","family":"Hor\u0148\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuzana","family":"Kockov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"766_CR1","doi-asserted-by":"crossref","unstructured":"Balister, P.N.: Packing circuits into KN. Comb. Probab. Comput. 6, 463\u2013499 (2001)","DOI":"10.1017\/S0963548301004771"},{"key":"766_CR2","unstructured":"Balister, P.N.: Packing closed trails into dense graphs. J. Combin. Theory Ser. B 88, 107\u2013118 (2003)"},{"key":"766_CR3","unstructured":"Balister, P.N.: Packing digraphs with directed closed trails. Combin. Probab. Comput. 12, 1\u201315 (2003)"},{"key":"766_CR4","doi-asserted-by":"crossref","unstructured":"Balister, P.N., Bollob\u00e1s, B., Schelp, R.H.: Vertex-distinguishing colorings of graphs with \u0394(G)\u00a0=\u00a02. Discrete Math. 252, 17\u201329 (2002)","DOI":"10.1016\/S0012-365X(01)00287-4"},{"key":"766_CR5","doi-asserted-by":"crossref","unstructured":"Cichacz, S.: Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails. Discuss. Math. Graph Theory 27, 241\u2013249 (2007)","DOI":"10.7151\/dmgt.1358"},{"key":"766_CR6","unstructured":"Cichacz, S., Przyby\u0142o, J., Wo\u017aniak, M.: Decompositions of pseudographs into closed trails of even sizes (submitted)"},{"key":"766_CR7","doi-asserted-by":"crossref","unstructured":"Fijav\u017e, G., Juvan, M., Mohar, B., \u0160krekovski, R.: Planar graphs without cycles of specific lengths. Europ. J. Combin. 23, 377\u2013388 (2002)","DOI":"10.1006\/eujc.2002.0570"},{"key":"766_CR8","unstructured":"Hor\u0148\u00e1k, M., Kockov\u00e1, Z.: On complete tripartite graphs arbitrarily decomposable into closed trails. Tatra Mt. Math. Publ. (to appear)"},{"key":"766_CR9","unstructured":"Hor\u0148\u00e1k, M., Kockov\u00e1, Z.: Two extremal 4-connected planar graphs arbitrarily decomposable into closed trails (under preparation)"},{"key":"766_CR10","unstructured":"Hor\u0148\u00e1k, M., Wo\u017aniak, M.: Decomposition of complete bipartite even graphs into closed trails. Czechoslovak Math. J. 53 (128), 127\u2013134 (2003)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0766-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0766-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0766-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:28Z","timestamp":1559055508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0766-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["766"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0766-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}