{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:19:44Z","timestamp":1725517184730},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852377"},{"type":"electronic","value":"9783540852384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_42","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T11:34:36Z","timestamp":1219059276000},"page":"515-526","source":"Crossref","is-referenced-by-count":4,"title":["Colouring Random Empire Trees"],"prefix":"10.1007","author":[{"given":"Andrew R.","family":"McGrae","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Zito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. Annals of Mathematics\u00a0162 (2005)","DOI":"10.4007\/annals.2005.162.1335"},{"issue":"5","key":"42_CR2","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1090\/S0002-9904-1976-14122-5","volume":"82","author":"K. Appel","year":"1976","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. American Mathematical Society Bulletin\u00a082(5), 711\u2013712 (1976)","journal-title":"American Mathematical Society Bulletin"},{"key":"42_CR3","volume-title":"Algebraic Graph Theory","author":"N. Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993)","edition":"2"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/3-540-45061-0_84","volume-title":"Automata, Languages and Programming","author":"M. Bodirsky","year":"2003","unstructured":"Bodirsky, M., Gr\u00f6pl, C., Kang, M.: Generating labeled planar graphs uniformly at random. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1095\u20131107. Springer, Heidelberg (2003)"},{"key":"42_CR5","first-page":"61","volume":"113","author":"A. Denise","year":"1996","unstructured":"Denise, A., Vasconcellos, M., Welsh, D.J.A.: The random planar graph. Congressus Numerantium\u00a0113, 61\u201379 (1996)","journal-title":"Congressus Numerantium"},{"key":"42_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1720-6","volume-title":"The Four-Color Theorem","author":"R. Fritsch","year":"1998","unstructured":"Fritsch, R., Fritsch, G.: The Four-Color Theorem. Springer, Heidelberg (1998)"},{"key":"42_CR7","volume-title":"Computer and Intractability, a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability, a Guide to the Theory of NP-Completeness. Freeman and Company, New York (1979)"},{"key":"42_CR8","first-page":"109","volume":"8","author":"H. Gr\u00f6tsch","year":"1959","unstructured":"Gr\u00f6tsch, H.: Ein dreifarbensatz f\u00fcr dreikreisfreie netze auf der kugel. Wiss. Z. Martin Luther-Univ. Halle Wittenberg, Math.-Nat. Reihe\u00a08, 109\u2013120 (1959)","journal-title":"Wiss. Z. Martin Luther-Univ. Halle Wittenberg, Math.-Nat. Reihe"},{"key":"42_CR9","first-page":"332","volume":"24","author":"P.J. Heawood","year":"1890","unstructured":"Heawood, P.J.: Map colour theorem. Quarterly Journal of Pure and Applied Mathematics\u00a024, 332\u2013338 (1890)","journal-title":"Quarterly Journal of Pure and Applied Mathematics"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.2307\/2690733","volume":"66","author":"J.P. Hutchinson","year":"1993","unstructured":"Hutchinson, J.P.: Coloring ordinary maps, maps of empires, and maps of the moon. Mathematics Magazine\u00a066, 211\u2013226 (1993)","journal-title":"Mathematics Magazine"},{"issue":"1","key":"42_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, B\u00a048(1), 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, B"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1515\/crll.1984.347.146","volume":"347","author":"B. Jackson","year":"1984","unstructured":"Jackson, B., Ringel, G.: Solution of Heawood\u2019s empire problem in the plane. Journal f\u00fcr die Reine und Angewandte Mathematik\u00a0347, 146\u2013153 (1984)","journal-title":"Journal f\u00fcr die Reine und Angewandte Mathematik"},{"key":"42_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. J. Wiley & Sons, Chichester (2000)"},{"key":"42_CR14","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.4153\/CJM-1968-104-8","volume":"20","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E.: Another Enumeration of Trees. Can. J of Math.\u00a020, 1077\u20131086 (1968)","journal-title":"Can. J of Math."},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.jctb.2004.09.007","volume":"93 B","author":"C. McDiarmid","year":"2005","unstructured":"McDiarmid, C., Steger, A., Welsh, D.J.A.: Random planar graphs. Journal of Combinatorial Theory\u00a093 B, 187\u2013205 (2005)","journal-title":"Journal of Combinatorial Theory"},{"key":"42_CR16","unstructured":"Moon, J.W.: Counting Labelled Trees. Canadian Mathematical Monographs, vol.\u00a01, Canadian Mathematical Congress (1970)"},{"issue":"3","key":"42_CR17","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1070\/RM1990v045n03ABEH002352","volume":"45","author":"I.M. Pak","year":"1994","unstructured":"Pak, I.M., Postnikov, A.E.: Enumeration of spanning trees of certain graphs. Russian Mathematical Survey\u00a045(3), 220 (1994)","journal-title":"Russian Mathematical Survey"},{"key":"42_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70 B","author":"N. Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. Journal of Combinatorial Theory\u00a070 B, 2\u201344 (1997)","journal-title":"Journal of Combinatorial Theory"},{"key":"42_CR19","unstructured":"Salavatipour, M.: Graph Colouring via the Discharging Method. PhD thesis, Department of Computer Science - University of Toronto (2003)"},{"key":"42_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1088\/0370-1328\/83\/1\/302","volume":"83","author":"H.N.V. Temperley","year":"1964","unstructured":"Temperley, H.N.V.: On the mutual cancellation of cluster integrals in Mayer\u2019s fugacity series. Proceedings of the Physical Society\u00a083, 3\u201316 (1964)","journal-title":"Proceedings of the Physical Society"},{"key":"42_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0012-365X(98)00110-1","volume":"191","author":"W. Wessel","year":"1998","unstructured":"Wessel, W.: A short solution of Heawood\u2019s empire problem in the plane. Discrete Mathematics\u00a0191, 241\u2013245 (1998)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:31:31Z","timestamp":1619508691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}