{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:25:35Z","timestamp":1780352735564,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642130724","type":"print"},{"value":"9783642130731","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13073-1_19","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T04:09:58Z","timestamp":1273464598000},"page":"204-216","source":"Crossref","is-referenced-by-count":3,"title":["A Planar Linear Arboricity Conjecture"],"prefix":"10.1007","author":[{"given":"Marek","family":"Cygan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u0141ukasz","family":"Kowalik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Borut","family":"Lu\u017ear","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"19_CR1","first-page":"405","volume":"30","author":"J. Akiyama","year":"1980","unstructured":"Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs III: Cyclic and acyclic invariants. Math. Slovaca.\u00a030, 405\u2013417 (1980)","journal-title":"Math. Slovaca."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/net.3230110108","volume":"11","author":"J. Akiyama","year":"1981","unstructured":"Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs IV: Linear arboricity. Networks\u00a011, 69\u201372 (1981)","journal-title":"Networks"},{"issue":"3","key":"19_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02783300","volume":"62","author":"N. Alon","year":"1988","unstructured":"Alon, N.: The linear arboricity of graphs. Israel Journal of Mathematics\u00a062(3), 311\u2013325 (1988)","journal-title":"Israel Journal of Mathematics"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/PL00007233","volume":"17","author":"N. Alon","year":"2001","unstructured":"Alon, N., Teague, V., Wormald, N.C.: Linear arboricity and linear k-arboricity of regular graphs. Graphs and Combinatorics\u00a017(1), 11\u201316 (2001)","journal-title":"Graphs and Combinatorics"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s00453-007-9044-3","volume":"50","author":"R. Cole","year":"2008","unstructured":"Cole, R., Kowalik, \u0141.: New linear-time algorithms for edge-coloring planar graphs. Algorithmica\u00a050(3), 351\u2013368 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/050646196","volume":"21","author":"R. Cole","year":"2007","unstructured":"Cole, R., Kowalik, \u0141., \u0160krekovski, R.: A generalization of Kotzig\u2019s theorem and its application. SIAM Journal on Discrete Mathematics\u00a021(1), 93\u2013106 (2007)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Cygan, M., Kowalik, \u0141., Lu\u017ear, B.: A planar linear arboricity conjecture. arXiv.org e-Print archive, arXiv:0912.5528v1 (2009)","DOI":"10.1007\/978-3-642-13073-1_19"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190080211","volume":"8","author":"H. Enomoto","year":"1984","unstructured":"Enomoto, H., P\u00e9roche, B.: The linear arboricity of some regular graphs. J. Graph Theory\u00a08, 309\u2013324 (1984)","journal-title":"J. Graph Theory"},{"issue":"3","key":"19_CR9","first-page":"225","volume":"36","author":"F. Guldan","year":"1986","unstructured":"Guldan, F.: The linear arboricity of 10-regular graphs. Math. Slovaca.\u00a036(3), 225\u2013228 (1986)","journal-title":"Math. Slovaca."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1111\/j.1749-6632.1970.tb56470.x","volume":"175","author":"F. Harary","year":"1970","unstructured":"Harary, F.: Covering and packing in graphs I. Ann. N.Y. Acad. Sci.\u00a0175, 198\u2013205 (1970)","journal-title":"Ann. N.Y. Acad. Sci."},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1145\/320211.320215","volume":"46","author":"M.R. Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V.: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM\u00a046(4), 502\u2013516 (1999)","journal-title":"J. ACM"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1051\/ro\/1982160201251","volume":"16","author":"B. Peroche","year":"1982","unstructured":"Peroche, B.: Complexity of the linear arboricity of a graph (In French). RAIRO Oper. Res.\u00a016, 125\u2013129 (1982) (in French)","journal-title":"RAIRO Oper. Res."},{"key":"19_CR13","first-page":"9","volume":"5","author":"V.G. Vizing","year":"1965","unstructured":"Vizing, V.G.: Critical graphs with a given chromatic number. Diskret. Analiz\u00a05, 9\u201317 (1965)","journal-title":"Diskret. Analiz"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<129::AID-JGT5>3.0.CO;2-A","volume":"31","author":"J.L. Wu","year":"1999","unstructured":"Wu, J.L.: On the linear arboricity of planar graphs. J. Graph Theory\u00a031, 129\u2013134 (1999)","journal-title":"J. Graph Theory"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1002\/jgt.20305","volume":"58","author":"J.L. Wu","year":"2008","unstructured":"Wu, J.L., Wu, Y.W.: The linear arboricity of planar graphs of maximum degree seven is four. J. Graph Theory\u00a058(3), 210\u2013220 (2008)","journal-title":"J. Graph Theory"},{"issue":"1-3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.tcs.2007.05.003","volume":"381","author":"J.L. Wu","year":"2007","unstructured":"Wu, J.L., Hou, J.F., Liu, G.Z.: The linear arboricity of planar graphs with no short cycles. Theor. Comput. Sci.\u00a0381(1-3), 230\u2013233 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR17","unstructured":"Wu, J.L., Hou, J.F., Sun, X.Y.: A note on the linear arboricity of planar graphs without 4-cycles. In: International Symposium on Operations Research and Its Applications, pp. 174\u2013178 (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:46:28Z","timestamp":1559083588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}