{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:02Z","timestamp":1725663182109},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540186250"},{"type":"electronic","value":"9783540480334"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18625-5_42","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:41:20Z","timestamp":1330198880000},"page":"58-64","source":"Crossref","is-referenced-by-count":1,"title":["An algorithm for colouring perfect planar graphs"],"prefix":"10.1007","author":[{"given":"Iain A.","family":"Stewart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"6_CR1","unstructured":"C. BERGE, Sur une conjecture relative au probl\u00e8me des codes optimaux, Comm. 13ieme Assemblee Gen. URSI, Tokyo, 1962."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0603022","volume":"3","author":"H. N. Djidjev","year":"1982","unstructured":"H. N. DJIDJEV, On the problem of partitioning planar graphs, SIAM J. Algebraic Discrete Methods 3 (1982), 229\u2013240.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"6_CR3","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. Golumbic","year":"1980","unstructured":"M. GOLUMBIC, \"Algorithmic Graph Theory and Perfect Graphs\", Academic Press, New York, 1980."},{"key":"6_CR4","unstructured":"C. GRINSTEAD, \"Toroidal Graphs and the Strong Perfect Graph Conjecture\", Ph.D Thesis, UCLA, 1978."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. Garey","year":"1976","unstructured":"M. GAREY, D. JOHNSON AND L. STOCKMEYER, Some simplified NP-complete graph problems, Theoretical Computer Science 1 (1976), 237\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"6_CR6","unstructured":"W. HSU, \"How to Colour Claw-Free Perfect Graphs\", Tech. Report #435, Cornell School of Operations Research and Industrial Eng., 1979."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. Lipton","year":"1979","unstructured":"R. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979), 177\u2013189.","journal-title":"SIAM J. Appl. Math."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"G. L. MILLER, Finding small simple cycle separators for 2-connected planar graphs, Sixteenth Symp. Theory of Comp. 1984, 376\u2013382.","DOI":"10.1145\/800057.808703"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0095-8956(76)80005-6","volume":"21","author":"K. Parthasarathy","year":"1976","unstructured":"K. PARTHASARATHY AND G. RAVINDRA, The strong perfect graph conjecture is true for K1\u20133-free graphs, J. Combinatorial Theory Ser. B 21 (1976), 212\u2013223.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1137\/1015072","volume":"15","author":"A. Tucker","year":"1973","unstructured":"A. TUCKER, Perfect graphs and an application to optimizing municipal services, SIAM Rev. 15 (1973), 585\u2013590.","journal-title":"SIAM Rev."},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4153\/CJM-1973-009-3","volume":"25","author":"A. Tucker","year":"1973","unstructured":"A. TUCKER, The strong perfect graph conjecture for planar graphs, Canad. J. Math. 25 (1973), 103\u2013114.","journal-title":"Canad. J. Math."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0095-8956(77)90064-8","volume":"23","author":"A. Tucker","year":"1977","unstructured":"A. TUCKER, Critical perfect graphs and perfect 3-chromatic graphs, J. Combinatorial Theory Ser. B 23 (1977), 143\u2013149.","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0196-6774(84)90040-3","volume":"5","author":"A. Tucker","year":"1984","unstructured":"A. TUCKER AND D. WILSON, An O(N2) algorithm for colouring perfect planar graphs, Journal of Algorithms 5 (1984), 60\u201368.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18625-5_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:12Z","timestamp":1605644112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18625-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540186250","9783540480334"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-18625-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}