{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:53:42Z","timestamp":1742964822164,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_27","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"320-332","source":"Crossref","is-referenced-by-count":1,"title":["The Local Nature of List Colorings for Graphs of High Girth"],"prefix":"10.1007","author":[{"given":"Flavio","family":"Chierichetti","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Vattani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-end packet-scheduling in wireless ad-hoc networks. In: Proc. 15th ACM-SIAM Symp. on Discrete Alg (SODA 2004), pp. 1021\u20131030 (2004)"},{"key":"27_CR2","unstructured":"Behzad, M.: The total chromatic number. Comb. Math. and its Appl. (Proc. Conf., Oxford 1969). Academic Press, London (1971)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02582936","volume":"1","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B., Harris, A.J.: List colorings of graphs. Graphs and Combinatorics\u00a01, 115\u2013127 (1985)","journal-title":"Graphs and Combinatorics"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: List edge and list total colourings of multigraphs. J. Comb. Theory, Series B\u00a071 (1997)","DOI":"10.1006\/jctb.1997.1780"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Czygrinow, A., Handckowiak, M., Karonski, M.: Distributed O(\u0394logn)-Edge-Coloring Algorithm. In: Proc. 9th Europ. Symp. on Alg. (2001)","DOI":"10.1007\/3-540-44676-1_29"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Dubhashi, D., Grable, D., Panconesi, A.: Nearly-optimal, distributed edge-colouring via the nibble method. Theoretical Computer Science\u00a0203 (1998)","DOI":"10.1016\/S0304-3975(98)00022-X"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1112\/S0025579300003260","volume":"9","author":"P. Erd\u00f6s","year":"1962","unstructured":"Erd\u00f6s, P.: On circuits and subgraphs of chromatic graphs. Mathematika\u00a09, 170\u2013175 (1962)","journal-title":"Mathematika"},{"key":"27_CR8","unstructured":"Erd\u00f6s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium XXVI, pp. 125\u2013157 (1979)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00493-007-0050-5","volume":"27","author":"S. Isobe","year":"2007","unstructured":"Isobe, S., Zhou, X., Nishizeki, T.: Total colorings of degenerate graphs. Combinatorica\u00a027, 167\u2013182 (2007)","journal-title":"Combinatorica"},{"key":"27_CR10","volume-title":"Graph Coloring Problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. John Wiley & Sons, New York (1995)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Juvan, M., Mohar, B., \u0160krekovski, R.: List Total Colourings of Graphs. Comb., Prob. and Comp.\u00a07(2) (1998)","DOI":"10.1017\/S0963548397003210"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/1098-2418(200009)17:2<117::AID-RSA3>3.0.CO;2-9","volume":"17","author":"J. Kahn","year":"2000","unstructured":"Kahn, J.: Asymptotics of the List Chromatic Index for Multigraph. Random Struct. & Alg.\u00a017, 117\u2013156 (2000)","journal-title":"Random Struct. & Alg."},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Kostochka, A.V.: List edge chromatic number of graphs with large girth. Discrete Math.\u00a0101 (1992)","DOI":"10.1016\/0012-365X(92)90602-C"},{"issue":"1","key":"27_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. on Comp.\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM J. on Comp."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08, 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"27_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lecture Notes in Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lecture Notes in Discrete Geometry. Springer, New York (2002)"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/PL00009820","volume":"18","author":"M. Molloy","year":"1998","unstructured":"Molloy, M., Reed, B.: A bound on the Total Chromatic Number. Combinatorica\u00a018, 241\u2013280 (1998)","journal-title":"Combinatorica"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Panconesi, A., Srinivasan, A.: Fast randomized algorithms for distributed edge coloring. SIAM J. on Comp.\u00a026(2) (1997)","DOI":"10.1137\/S0097539793250767"},{"key":"27_CR19","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz.\u00a03, 25\u201330 (1964)","journal-title":"Diskret. Analiz."},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Zhou, X., Nishizeki, T.: Edge-coloring and f-coloring for various classes of graphs. J. Graph Algorithms and Applications\u00a03(1) (1999)","DOI":"10.7155\/jgaa.00012"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:27:31Z","timestamp":1714620451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}