{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:05:06Z","timestamp":1725487506475},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725879"},{"type":"electronic","value":"9783540725886"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72588-6_53","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T18:35:23Z","timestamp":1184610923000},"page":"320-328","source":"Crossref","is-referenced-by-count":10,"title":["Some Results on List Total Colorings of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Jianfeng","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guizhen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianliang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_CR1","unstructured":"Behzad, M.: Graphs and their chromatic number. Doctoral Thesis, Michigan State University (1965)"},{"key":"53_CR2","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":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan Press, London (1976)"},{"key":"53_CR3","first-page":"180","volume":"394","author":"O.V. Borodin","year":"1989","unstructured":"Borodin, O.V.: On the total coloring of planar graphs. J. Reine Angew. Math.\u00a0394, 180\u2013185 (1989)","journal-title":"J. Reine Angew. Math."},{"key":"53_CR4","first-page":"22","volume":"48","author":"O.V. Borodin","year":"1990","unstructured":"Borodin, O.V.: An extension of Kotzig theorem and the list edge coloring of plane graphs (in Russian). Matem. Zametki\u00a048, 22\u201348 (1990)","journal-title":"Matem. Zametki"},{"key":"53_CR5","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/jctb.1997.1780","volume":"71","author":"O.V. Borodin","year":"1997","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: List edge and list total colorings of multigrahs. J. of Combin. Theory Series B\u00a071, 184\u2013204 (1997)","journal-title":"J. of Combin. Theory Series B"},{"key":"53_CR6","first-page":"125","volume":"26","author":"P. Erd\u00f6s","year":"1980","unstructured":"Erd\u00f6s, P., Rubin, A., Taylor, H.: Choosability in graphs. Congr. Number.\u00a026, 125\u2013157 (1980)","journal-title":"Congr. Number."},{"key":"53_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/jctb.1995.1011","volume":"63","author":"F. Galvin","year":"1995","unstructured":"Galvin, F.: The list chromatic index of a bipartite multigraph. J. Combin. Theory Ser. B\u00a063, 153\u2013158 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"key":"53_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1017\/S0963548397002927","volume":"6","author":"P. H\u00e4ggkvist","year":"1997","unstructured":"H\u00e4ggkvist, P., Janssen, J.: New bounds on the list-chromatic index of the complete graph and othe simple graphs. Combin., Probab. and Comput.\u00a06, 295\u2013313 (1997)","journal-title":"Combin., Probab. and Comput."},{"key":"53_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1017\/S0963548397003210","volume":"7","author":"M. Juvan","year":"1998","unstructured":"Juvan, M., Mohar, B., \u0160krekovski, R.: List total colorings of graphs. Combin., Probab. and Comput.\u00a07, 181\u2013188 (1998)","journal-title":"Combin., Probab. and Comput."},{"key":"53_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(77)90146-7","volume":"17","author":"A.V. Kostochka","year":"1977","unstructured":"Kostochka, A.V.: The total coloring of a multigraph with maximum degree 4. Discrete Math.\u00a017, 161\u2013163 (1977)","journal-title":"Discrete Math."},{"key":"53_CR11","unstructured":"Kostochka, A.V.: Exact upper bound for the total chromatic number of a graph (in Russian). In: Proc. 24th Int. Koll. Tech. Hochsch. Ilmenau, pp. 33\u201336 (1979)"},{"key":"53_CR12","unstructured":"Kostochka, A.V.: Upper bounds of chromatic functions on graphs (in Russian). Doctoral Thesis, Novosibirsk (1978)"},{"key":"53_CR13","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/BF02771690","volume":"9","author":"M. Rosenfeld","year":"1971","unstructured":"Rosenfeld, M.: On the total coloring of certain graphs. Israel J. Math.\u00a09, 396\u2013402 (1971)","journal-title":"Israel J. Math."},{"key":"53_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/(SICI)1097-0118(199905)31:1<67::AID-JGT6>3.0.CO;2-C","volume":"31","author":"D.P. Sanders","year":"1999","unstructured":"Sanders, D.P., Zhao, Y.: On total 9-coloring planar graphs of maximum degree seven. J. Graph Theory\u00a031, 67\u201373 (1999)","journal-title":"J. Graph Theory"},{"issue":"2","key":"53_CR15","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1112\/jlms\/s2-3.3.405","volume":"3","author":"N. Vijayaditya","year":"1971","unstructured":"Vijayaditya, N.: On total chromatic number of a graph. J. London Math. Soc.\u00a03(2), 405\u2013408 (1971)","journal-title":"J. London Math. Soc."},{"key":"53_CR16","first-page":"117","volume":"23","author":"V.Z. Vizing","year":"1968","unstructured":"Vizing, V.Z.: Some unsolved problems in graph theory (in Russian). Uspekhi Mat. Nauk\u00a023, 117\u2013134 (1968)","journal-title":"Uspekhi Mat. Nauk"},{"key":"53_CR17","first-page":"3","volume":"29","author":"V.G. Vizing","year":"1976","unstructured":"Vizing, V.G.: Coloring the vertices of a graph in prescribed colors (in Russian). Diskret. Anal.\u00a029, 3\u201310 (1976)","journal-title":"Diskret. Anal."},{"key":"53_CR18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/eujc.2000.0430","volume":"22","author":"W.F. Wang","year":"2001","unstructured":"Wang, W.F., Lih, K.W.: Choosability, edge-choosability and total choosability of outerplane graphs. European J. Combin.\u00a022, 71\u201378 (2001)","journal-title":"European J. Combin."},{"key":"53_CR19","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0012-365X(98)00297-0","volume":"202","author":"D.R. Woodall","year":"1999","unstructured":"Woodall, D.R.: Edge-choosability of multicircuits. Discrete Math.\u00a0202, 271\u2013277 (1999)","journal-title":"Discrete Math."},{"key":"53_CR20","series-title":"Lecture note in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0092895","volume-title":"Total Colourings of Graphs","author":"H.P. Yap","year":"1996","unstructured":"Yap, H.P.: Total Colourings of Graphs. Lecture note in Mathematics, vol.\u00a01623. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72588-6_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T02:12:04Z","timestamp":1550455924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72588-6_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725879","9783540725886"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72588-6_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}