{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:32:17Z","timestamp":1730313137550,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,5,22]]},"DOI":"10.1145\/1060590.1060666","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"504-512","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Edge partition of planar sraphs into two outerplanar graphs"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Gon\u00e7alves","sequence":"first","affiliation":[{"name":"Universit\u00e9 Bordeaux 1, Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,5,22]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1002\/jgt.3190200303"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1016\/0095-8956(71)90065-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1002\/jgt.3190140408"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1006\/jctb.2000.1962"},{"key":"e_1_3_2_1_5_1","volume-title":"Congr. Numer., 66: 69--80, 1988. Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing","author":"El-Mallah E. S.","year":"1988","unstructured":"E. S. El-Mallah and C. J. Colbourn . Partitioning the edges of a planar graph into two partial k-trees . Congr. Numer., 66: 69--80, 1988. Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing ( Baton Rouge, LA , 1988 ). E. S. El-Mallah and C. J. Colbourn. Partitioning the edges of a planar graph into two partial k-trees. Congr. Numer., 66:69--80, 1988. Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1988)."},{"unstructured":"Daniel Gon\u00e7alves. On the caterpillar arboricity of planar graphs. Discrete Math. to appear.  Daniel Gon\u00e7alves. On the caterpillar arboricity of planar graphs. Discrete Math. to appear.","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","volume-title":"On some arboricities in planar graphs. submitted","author":"Gon\u00e7alves Daniel","year":"2005","unstructured":"Daniel Gon\u00e7alves and Pascal Ochem . On some arboricities in planar graphs. submitted , 2005 . Daniel Gon\u00e7alves and Pascal Ochem. On some arboricities in planar graphs. submitted, 2005."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1016\/S0012-365X(99)00175-2"},{"key":"e_1_3_2_1_9_1","volume-title":"Graph coloring problems","author":"Jensen T. R.","year":"1995","unstructured":"T. R. Jensen and B. Toft . Graph coloring problems . Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York, 1995 . A Wiley-Interscience Publication . T. R. Jensen and B. Toft. Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., New York, 1995. A Wiley-Interscience Publication."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1006\/jctb.1996.0043"},{"key":"e_1_3_2_1_11_1","first-page":"5","volume-title":"Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing","volume":"139","author":"Alexandr","year":"1999","unstructured":"Alexandr V. Kostochka and Douglas B. West. Every outerplanar graph is the union of two interval graphs . In Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing ( Boca Raton, FL , 1999 ), volume 139 , pages 5 -- 8 , 1999. Alexandr V. Kostochka and Douglas B. West. Every outerplanar graph is the union of two interval graphs. In Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999), volume 139, pages 5--8, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/PL00007219"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1112\/jlms\/s1-39.1.12"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1090\/S0002-9947-1956-0081471-8"},{"key":"e_1_3_2_1_15_1","volume-title":"25--30","author":"Vizing V. G.","year":"1964","unstructured":"V. G. Vizing . On an estimate of the chromatic class of a p-graph. Diskret . Analiz No ., 3 : 25--30 , 1964 . V. G. Vizing. On an estimate of the chromatic class of a p-graph. Diskret. Analiz No., 3:25--30, 1964."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.2307\/1968197"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC05","name":"STOC05: Symposium on Theory of Computing","location":"Baltimore MD USA"},"container-title":["Proceedings of the thirty-seventh annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1060590.1060666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:30:42Z","timestamp":1673166642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1060590.1060666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5,22]]},"references-count":16,"alternative-id":["10.1145\/1060590.1060666","10.1145\/1060590"],"URL":"https:\/\/doi.org\/10.1145\/1060590.1060666","relation":{},"subject":[],"published":{"date-parts":[[2005,5,22]]},"assertion":[{"value":"2005-05-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}