{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:50Z","timestamp":1725663530613},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564027"},{"type":"electronic","value":"9783540475545"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56402-0_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:09:00Z","timestamp":1330254540000},"page":"90-102","source":"Crossref","is-referenced-by-count":2,"title":["Kayles on special classes of graphs \u2014 An application of Sprague-Grundy theory"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"10_CR1","volume-title":"Winning Ways for your mathematical plays, Volume 1: Games in General","author":"E. R. Berlekamp","year":"1982","unstructured":"E. R. Berlekamp, J. H. Conway, and R. K. Guy. Winning Ways for your mathematical plays, Volume 1: Games in General. Academic Press, New York, 1982."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. S. Booth","year":"1976","unstructured":"K. S. Booth and G. S. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comp. Syst. Sc., 13:335\u2013379, 1976.","journal-title":"J. Comp. Syst. Sc."},{"key":"10_CR3","volume-title":"On Numbers and Games","author":"J. H. Conway","year":"1976","unstructured":"J. H. Conway. On Numbers and Games. Academic Press, London, 1976."},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"4","author":"D. G. Corneil","year":"1985","unstructured":"D. G. Corneil, Y. Perl, and L. K. Stewart. A linear recognition algorithm for cographs. SIAM J. Comput., 4:926\u2013934, 1985.","journal-title":"SIAM J. Comput."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 524\u2013531, 1988.","DOI":"10.1109\/SFCS.1988.21968"},{"key":"10_CR6","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980."},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","volume":"43","author":"M. C. Golumbic","year":"1983","unstructured":"M. C. Golumbic, D. Rotem, and J. Urrutia. Comparability graphs and intersection graphs. Disc. Math., 43:37\u201346, 1983.","journal-title":"Disc. Math."},{"key":"10_CR8","unstructured":"D. K\u00f6nig. Theorie der endlichen und unendlichen Graphen. Akademische Verlagsgesellschaft, Leipzig, 1936."},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"T. J. Schaefer","year":"1978","unstructured":"T. J. Schaefer. On the complexity of some two-person perfect-information games. J. Comp. Syst. Sc., 16:185\u2013225, 1978.","journal-title":"J. Comp. Syst. Sc."},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0209001","volume":"9","author":"A. Tucker","year":"1980","unstructured":"A. Tucker. An efficient test for circular-arc graphs. SIAM J. Comput., 9:1\u201324, 1980.","journal-title":"SIAM J. Comput."},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1984","unstructured":"P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99\u2013127, 1984.","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56402-0_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:51:35Z","timestamp":1619571095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56402-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564027","9783540475545"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-56402-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}