{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:25:19Z","timestamp":1763663119493},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00493-013-2573-2","type":"journal-article","created":{"date-parts":[[2013,7,3]],"date-time":"2013-07-03T05:55:18Z","timestamp":1372830918000},"page":"253-296","source":"Crossref","is-referenced-by-count":22,"title":["A unified approach to distance-two colouring of graphs on surfaces"],"prefix":"10.1007","volume":"33","author":[{"given":"Omid","family":"Amini","sequence":"first","affiliation":[]},{"given":"Louis","family":"Esperet","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Van Den Heuvel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,3]]},"reference":[{"key":"2573_CR1","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1137\/S0895480100367950","volume":"16","author":"G Agnarsson","year":"2003","unstructured":"G. Agnarsson and M. M. Halld\u00f3rsson: Coloring powers of planar graphs, SIAM J. Discrete Math. 16 (2003), 651\u2013662.","journal-title":"SIAM J. Discrete Math."},{"key":"2573_CR2","series-title":"Grad. Texts in Math.","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J A Bondy","year":"2008","unstructured":"J. A. Bondy and U. S. R. Murty: Graph Theory, Grad. Texts in Math. 244, Springer-Verlag, New York, 2008."},{"key":"2573_CR3","first-page":"12","volume":"41","author":"O V Borodin","year":"1984","unstructured":"O. V. Borodin: Solution of the Ringel problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs (in Russian), Metody Diskret. Analyz. 41 (1984), 12\u201326.","journal-title":"Metody Diskret. Analyz."},{"issue":"4","key":"2573_CR4","first-page":"9","volume":"8","author":"O V Borodin","year":"2001","unstructured":"O. V. Borodin, H. J. Broersma, A. Glebov and J. van den Heuvel: Minimal degrees and chromatic numbers of squares of planar graphs (in Russian), Diskretn. Anal. Issled. Oper. Ser. 1 8, no. 4 (2001), 9\u201333.","journal-title":"Diskretn. Anal. Issled. Oper. Ser. 1"},{"key":"2573_CR5","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1002\/jgt.20193","volume":"54","author":"O V Borodin","year":"2007","unstructured":"O. V. Borodin, H. J. Broersma, A. Glebov and J. van den Heuvel: A new upper bound on the cyclic chromatic number, J. Graph Theory 54 (2007), 58\u201372.","journal-title":"J. Graph Theory"},{"key":"2573_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0012-365X(99)00018-7","volume":"203","author":"O V Borodin","year":"1999","unstructured":"O. V. Borodin, D. P. Sanders and Y. Zhao: On cyclic colorings and their generalizations, Discrete Math. 203 (1999), 23\u201340.","journal-title":"Discrete Math."},{"key":"2573_CR7","unstructured":"N. Cohen and J. van den Heuvel: An exact bound on the clique number of the square of a planar graph, in preparation."},{"key":"2573_CR8","series-title":"Grad. Texts in Math.","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"R. Diestel: Graph Theory, Grad. Texts in Math. 173, Springer-Verlag, Berlin, 2005."},{"key":"2573_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"J. Edmonds: Maximum matching and a polyhedron with 0;1-vertices, J. Res. Nat. Bur. Standards Sect. B 69B (1965), 125\u2013130.","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"2573_CR10","volume-title":"List colouring squares of planar graphs","author":"F Havet","year":"2008","unstructured":"F. Havet, J. van den Heuvel, C. McDiarmid and B. Reed: List colouring squares of planar graphs, Preprint (2008), arxiv.org\/abs\/0807.3233."},{"key":"2573_CR11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(93)90166-Q","volume":"111","author":"P Hell","year":"1993","unstructured":"P. Hell and K. Seyffarth: Largest planar graphs of diameter two and fixed maximum degree, Discrete Math. 111 (1993), 313\u2013322.","journal-title":"Discrete Math."},{"key":"2573_CR12","doi-asserted-by":"crossref","first-page":"4037","DOI":"10.1016\/j.disc.2007.07.102","volume":"308","author":"T J Hetherington","year":"2008","unstructured":"T. J. Hetherington and D. R. Woodall: List-colouring the square of a K4-minorfree graph, Discrete Math. 308 (2008), 4037\u20134043.","journal-title":"Discrete Math."},{"key":"2573_CR13","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J v d Heuvel","year":"2003","unstructured":"J. van den Heuvel and S. McGuinness: Coloring the square of a planar graph, J. Graph Theory 42 (2003), 110\u2013124.","journal-title":"J. Graph Theory"},{"key":"2573_CR14","volume-title":"Graph Coloring Problems","author":"T R Jensen","year":"1995","unstructured":"T. R. Jensen and B. Toft: Graph Coloring Problems, John-Wiley & Sons, New York, 1995."},{"key":"2573_CR15","volume-title":"Graph coloring analogues with a condition at distance two: L(2; 1)-labelings and list \u03bb-labelings","author":"T K Jonas","year":"1993","unstructured":"T. K. Jonas: Graph coloring analogues with a condition at distance two: L(2; 1)-labelings and list \u03bb-labelings, Ph.D. Thesis, University of South Carolina, 1993."},{"key":"2573_CR16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1006\/jctb.1996.0067","volume":"68","author":"J Kahn","year":"1996","unstructured":"J. Kahn: Asymptotics of the chromatic index for multigraphs, J. Combin. Theory Ser. B 68 (1996), 233\u2013254.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2573_CR17","doi-asserted-by":"crossref","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":"J. Kahn: Asymptotics of the list-chromatic index for multigraphs, Random Structures Algorithms 17 (2000), 117\u2013156.","journal-title":"Random Structures Algorithms"},{"key":"2573_CR18","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01215919","volume":"17","author":"J Kahn","year":"1997","unstructured":"J. Kahn and P. M. Kayll: On the stochastic independence properties of hard-core distributions Combinatorica 17 (1997), 369\u2013391.","journal-title":"Combinatorica"},{"key":"2573_CR19","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0012-365X(00)00371-X","volume":"240","author":"A V Kostochka","year":"2001","unstructured":"A. V. Kostochka and D. R. Woodall: Choosability conjectures and multicircuits, Discrete Math. 240 (2001), 123\u2013143.","journal-title":"Discrete Math."},{"key":"2573_CR20","series-title":"Contemp. Math.","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1090\/conm\/114\/1097862","volume-title":"Mathematical Developments Arising from Linear Programming","author":"C W Lee","year":"1990","unstructured":"C. W. Lee: Some recent results on convex polytopes, in: J. C. Lagarias and M. J. Todd, eds., Mathematical Developments Arising from Linear Programming, Contemp. Math. 114 (1990), 3\u201319."},{"key":"2573_CR21","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0012-365X(03)00059-1","volume":"269","author":"K-W Lih","year":"2003","unstructured":"K.-W. Lih, W. F. Wang and X. Zhu: Coloring the square of a K4-minor free graph, Discrete Math. 269 (2003), 303\u2013309.","journal-title":"Discrete Math."},{"key":"2573_CR22","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/BF01350657","volume":"178","author":"W Mader","year":"1968","unstructured":"W. Mader: Homomorphies\u00e4tze f\u00fcr Graphen, Math. Ann. 178 (1968), 154\u2013168.","journal-title":"Math. Ann."},{"key":"2573_CR23","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"B. Mohar and C. Thomassen: Graphs on Surfaces, Johns Hopkins University Press, Baltimore, 2001."},{"key":"2573_CR24","series-title":"Algorithms Combin.","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph Colouring and the Probabilistic Method","author":"M Molloy","year":"2002","unstructured":"M. Molloy and B. Reed: Graph Colouring and the Probabilistic Method, Algorithms Combin. 23, Springer-Verlag, Berlin, 2002."},{"key":"2573_CR25","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jctb.2004.12.005","volume":"94","author":"M Molloy","year":"2005","unstructured":"M. Molloy and M. R. Salavatipour: A bound on the chromatic number of the square of a planar graph, J. Combin. Theory Ser. B 94 (2005), 189\u2013213.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2573_CR26","first-page":"287","volume-title":"Recent Progress in Combinatorics; Proceedings of the Third Waterloo Conference on Combinatorics","author":"O Ore","year":"1969","unstructured":"O. Ore and M. D. Plummer: Cyclic coloration of plane graphs, in: Recent Progress in Combinatorics; Proceedings of the Third Waterloo Conference on Combinatorics, Academic Press, San Diego (1969) 287\u2013293."},{"key":"2573_CR27","first-page":"304","volume-title":"Proceedings of the 33rd Annual Conference on Foundations of Computer Science (FOCS)","author":"Y Rabinovich","year":"1992","unstructured":"Y. Rabinovich, A. Sinclair and A. Wigderson: Quadratic dynamical systems, in: Proceedings of the 33rd Annual Conference on Foundations of Computer Science (FOCS), (1992), 304\u2013313."},{"key":"2573_CR28","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"81","author":"N Robertson","year":"2003","unstructured":"N. Robertson and P. Seymour: Graph minors XVI. Excluding a non-planar graph, J. Combin. Theory Ser. B 81 (2003), 43\u201376.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2573_CR29","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/jctb.2001.2046","volume":"83","author":"D P Sanders","year":"2001","unstructured":"D. P. Sanders and Y. Zhao: A new bound on the cyclic chromatic number, J. Combin. Theory Ser. B 83 (2001), 102\u2013111.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2573_CR30","volume-title":"Algorithms Combin","author":"A Schrijver","year":"2003","unstructured":"A. Schrijver: Combinatorial Optimization; Polyhedra and Efficiency, Algorithms Combin. 24, Springer-Verlag, Berlin, 2003."},{"key":"2573_CR31","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1002\/sapm1949281148","volume":"28","author":"C E Shannon","year":"1949","unstructured":"C. E. Shannon: A theorem on colouring lines of a network, J. Math. Physics 28 (1949), 148\u2013151.","journal-title":"J. Math. Physics"},{"key":"2573_CR32","first-page":"25","volume":"3","author":"V G Vizing","year":"1964","unstructured":"V. G. Vizing: On an estimate of the chromatic class of a p-graph (in Russian), Metody Diskret. Analiz. 3 (1964), 25\u201330.","journal-title":"Metody Diskret. Analiz."},{"key":"2573_CR33","volume-title":"Graphs with given diameter and a coloring problem","author":"G Wegner","year":"1977","unstructured":"G. Wegner: Graphs with given diameter and a coloring problem, Technical Report, University of Dortmund, 1977."},{"key":"2573_CR34","volume-title":"Colouring graphs with respect to distance","author":"S A Wong","year":"1996","unstructured":"S. A. Wong: Colouring graphs with respect to distance, M.Sc. Thesis, Department of Combinatorics and Optimization, University of Waterloo, 1996."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2573-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-013-2573-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-013-2573-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T21:09:11Z","timestamp":1688332151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-013-2573-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["2573"],"URL":"https:\/\/doi.org\/10.1007\/s00493-013-2573-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}