{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:54:58Z","timestamp":1762505698502},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228233"},{"type":"electronic","value":"9783540286295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_19","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T12:59:50Z","timestamp":1292590790000},"page":"274-286","source":"Crossref","is-referenced-by-count":9,"title":["Group Coloring and List Group Coloring Are \u03a02 P -Complete"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Nejedl\u00fd","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N. Alon","year":"1992","unstructured":"Alon, N., Tarsi, M.: Colorings and Orientations of Graphs. Combinatorica\u00a012, 125\u2013134 (1992)","journal-title":"Combinatorica"},{"key":"19_CR2","volume-title":"Theory of Computational Complexity","author":"D.-Z. Du","year":"2000","unstructured":"Du, D.-Z., Ko, K.-I.: Theory of Computational Complexity. John Wiley & Sons, New York (2000)"},{"key":"19_CR3","first-page":"122","volume":"26","author":"P. Erd\u00f6s","year":"1980","unstructured":"Erd\u00f6s, P., Rubin, A.L., Taylor, H.: Choosability in Graphs. Congress. Numer.\u00a026, 122\u2013157 (1980)","journal-title":"Congress. Numer."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(95)00104-5","volume":"159","author":"S. Gutner","year":"1996","unstructured":"Gutner, S.: The Complexity of Planar Graph Choosability. Discrete Math.\u00a0159, 119\u2013130 (1996)","journal-title":"Discrete Math."},{"key":"19_CR5","doi-asserted-by":"publisher","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 \u2014 A Non-homogeneous Analogue of Nowhere-zero Flow. J. Combin. Theory Ser. B\u00a056, 165\u2013182 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"key":"19_CR6","unstructured":"Kr\u00e1l\u2019, D., Pangr\u00e1c, O., Voss, H.-J.: A Note on Group Colorings (submitted)"},{"key":"19_CR7","first-page":"299","volume":"62","author":"H.-J. Lai","year":"2002","unstructured":"Lai, H.-J., Zhang, X.: Group Colorability of Graphs. Ars Combin.\u00a062, 299\u2013317 (2002)","journal-title":"Ars Combin."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s003730200009","volume":"18","author":"H.-J. Lai","year":"2002","unstructured":"Lai, H.-J., Zhang, X.: Group Chromatic Number of Graphs without K5-minors. Graphs Comb.\u00a018, 147\u2013154 (2002)","journal-title":"Graphs Comb."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1006\/jctb.1998.1893","volume":"76","author":"P.C.B. Lam","year":"1999","unstructured":"Lam, P.C.B.: The 4-choosability of Plane Graphs without 4-cycles. J. Combin. Theory Ser. B\u00a076, 117\u2013126 (1999)","journal-title":"J. Combin. Theory Ser. B"},{"key":"19_CR10","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/jctb.1995.1027","volume":"64","author":"C. Thomassen","year":"1995","unstructured":"Thomassen, C.: 3-list-coloring Planar Graphs of Girth 5. J. Combin. Theory Ser. B\u00a064, 101\u2013107 (1995)","journal-title":"J. Combin. Theory Ser. B"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jctb.1994.1062","volume":"62","author":"C. Thomassen","year":"1994","unstructured":"Thomassen, C.: Every Planar Graph is 5-choosable. J. Combin. Theory Ser. B\u00a062, 180\u2013181 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"19_CR13","volume-title":"Integer Flows and Cycle Covers of Graphs","author":"C.Q. Zhang","year":"1996","unstructured":"Zhang, C.Q.: Integer Flows and Cycle Covers of Graphs. Marcel Dekker, New York (1996)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:27:53Z","timestamp":1619998073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}