{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:57:42Z","timestamp":1762505862888},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,11,29]],"date-time":"2011-11-29T00:00:00Z","timestamp":1322524800000},"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":[[2013,5]]},"DOI":"10.1007\/s00373-011-1114-2","type":"journal-article","created":{"date-parts":[[2011,11,28]],"date-time":"2011-11-28T10:07:32Z","timestamp":1322474852000},"page":"585-597","source":"Crossref","is-referenced-by-count":2,"title":["On Group Choosability of Total Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"H. J.","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. R.","family":"Omidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Raeisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,29]]},"reference":[{"key":"1114_CR1","unstructured":"Behzad, M.: Graphs and their chromatic numbers. Ph.D Thesis, Michigan State University (1965)"},{"key":"1114_CR2","doi-asserted-by":"crossref","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 coloring of multigraphs. J. Combin. Theory B 71, 184\u2013204 (1997)","journal-title":"J. Combin. Theory B"},{"key":"1114_CR3","first-page":"87","volume":"14","author":"O.V. Borodin","year":"1995","unstructured":"Borodin O.V., Woodall D.R.: Thirteen colouring numbers for outerplane graphs. Bull. Inst. Combin. Appl. 14, 87\u2013100 (1995)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"1114_CR4","doi-asserted-by":"crossref","first-page":"2233","DOI":"10.1016\/j.disc.2008.04.056","volume":"309","author":"Y. Chen","year":"2009","unstructured":"Chen Y., Zhu W., Wang W.F.: Edge choosability of planar graphs without 5-cycles with a chord. Discrete Math. 309, 2233\u20132238 (2009)","journal-title":"Discrete Math."},{"key":"1114_CR5","unstructured":"Chuang, H., Lai, H.-J., Omidi, G.R., Zakeri, N.: On group choosability of graphs I. Ars Combin. (2011, accepted)"},{"key":"1114_CR6","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel R.: Graph Theory, 3rd edn. Springer, Berlin (2005)","edition":"3"},{"key":"1114_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-27.1.85","volume":"27","author":"G.A. Dirac","year":"1952","unstructured":"Dirac G.A.: A property of 4-chroamic graphs and some remarks on critical graphs. J. Lond. Math. Soc. 27, 85\u201392 (1952)","journal-title":"J. Lond. Math. Soc."},{"key":"1114_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"J. Duffin","year":"1965","unstructured":"Duffin J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10, 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"key":"1114_CR9","first-page":"125","volume":"26","author":"P. Erd\u0151s","year":"1979","unstructured":"Erd\u0151s P., Rubin A.L., Taylor H.: Choosability in graphs. Congr. Numer. 26, 125\u2013157 (1979)","journal-title":"Congr. Numer."},{"key":"1114_CR10","doi-asserted-by":"crossref","first-page":"R98","DOI":"10.37236\/1124","volume":"13","author":"T.J. Hetherington","year":"2006","unstructured":"Hetherington T.J., Woodall D.R.: Edge and total choosability of near-outerplanar graphs. Electron. J. Combin. 13, R98 (2006)","journal-title":"Electron. J. Combin."},{"key":"1114_CR11","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0095-8956(92)90016-Q","volume":"56","author":"F. Jaeger","year":"1992","unstructured":"Jaeger F., Linial N., Payan C., Tarsi M.: Group connectivity of graphs\u2014a non homogeneous analogue of nowhere-zero flow properties. J. Combin. Theory B 56, 165\u2013182 (1992)","journal-title":"J. Combin. Theory B"},{"key":"1114_CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1017\/S0963548397003210","volume":"7","author":"M. Juvan","year":"1998","unstructured":"Juvan M., Mohar B., Skrekovski R.: List total colourings of graphs. Combin. Probab. Comput. 7, 181\u2013188 (1998)","journal-title":"Combin. Probab. Comput."},{"key":"1114_CR13","unstructured":"Khamseh, A., Omidi, G.R.: On edge-group choosability of graphs (2011, submitted)"},{"key":"1114_CR14","first-page":"111","volume":"5","author":"A. Kotzig","year":"1980","unstructured":"Kotzig A.: Contribution to the theory of Eulerian polyhedra. Math. Cas. SAV (Math. Slovaca) 5, 111\u2013113 (1980)","journal-title":"Math. Cas. SAV (Math. Slovaca)"},{"key":"1114_CR15","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-540-28629-5_19","volume":"3153","author":"D. Kr\u00e1l","year":"2004","unstructured":"Kr\u00e1l D., Nejedl\u00fd P.: Group coloring and list group coloring are \u03a0 2 P -Complete. Lect. Comp. Sci. 3153, 274\u2013287 (2004)","journal-title":"Lect. Comp. Sci."},{"key":"1114_CR16","doi-asserted-by":"crossref","first-page":"2998","DOI":"10.1016\/j.disc.2008.07.033","volume":"309","author":"Q. Ma","year":"2009","unstructured":"Ma Q., Wu J.L., Yu X.: Planar graphs without 5-cycles or without 6-cycles. Discrete Math. 309, 2998\u20133005 (2009)","journal-title":"Discrete Math."},{"key":"1114_CR17","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1112\/jlms\/s2-3.3.405","volume":"3","author":"N. Vijayaditya","year":"1971","unstructured":"Vijayaditya N.: On the total chromatic number of a graph. J. Lond. Math. Soc. 3, 405\u2013408 (1971)","journal-title":"J. Lond. Math. Soc."},{"key":"1114_CR18","unstructured":"Vizing, V.G.: Some unsolved problems in graph theory, Uspekhi Mat. Nauk 23 (1968), 117\u2013134 (in Russian). An Englsih translation can be found in Russian Mathg. Surveys 23, 125\u2013141"},{"key":"1114_CR19","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0893-9659(02)80007-6","volume":"15","author":"W.F. Wang","year":"2002","unstructured":"Wang W.F., Lih K.W.: Choosability and edge choosability of planar graphs without five cycles. Appl. Math. Lett. 15, 561\u2013565 (2002)","journal-title":"Appl. Math. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1114-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1114-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1114-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T01:50:17Z","timestamp":1593309017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1114-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,29]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1114"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1114-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,29]]}}}