{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T02:44:57Z","timestamp":1774838697504,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,10,20]],"date-time":"2013-10-20T00:00:00Z","timestamp":1382227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00153-013-0359-2","type":"journal-article","created":{"date-parts":[[2013,10,19]],"date-time":"2013-10-19T10:18:13Z","timestamp":1382177893000},"page":"137-155","source":"Crossref","is-referenced-by-count":4,"title":["Domatic partitions of computable graphs"],"prefix":"10.1007","volume":"53","author":[{"given":"Matthew","family":"Jura","sequence":"first","affiliation":[]},{"given":"Oscar","family":"Levin","sequence":"additional","affiliation":[]},{"given":"Tyler","family":"Markkanen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,10,20]]},"reference":[{"issue":"2","key":"359_CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.2307\/2272247","volume":"41","author":"D. Bean","year":"1976","unstructured":"Bean D.: Effective coloration. J. Symb. Logic 41(2), 469\u2013480 (1976)","journal-title":"J. Symb. Logic"},{"key":"359_CR2","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel R.: Graph Theory. 2nd edn. Springer, New York (2000)","edition":"2"},{"key":"359_CR3","doi-asserted-by":"crossref","unstructured":"Gasarch, W.: A survey of recursive combinatorics. In: Ershov, Goncharov, Marek, Nerode, Remmel (eds.) Handbook of Recursive Mathematics, vol. 2, pp. 1041\u20131176. Elsevier, Amsterdam (1998)","DOI":"10.1016\/S0049-237X(98)80049-9"},{"issue":"4","key":"359_CR4","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/malq.19980440405","volume":"44","author":"W. Gasarch","year":"1998","unstructured":"Gasarch W., Hirst J.: Reverse mathematics and recursive graph theory. MLQ Math. Log. Q. 44(4), 465\u2013473 (1998)","journal-title":"MLQ Math. Log. Q."},{"key":"359_CR5","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF02773868","volume":"76","author":"D. Harel","year":"1991","unstructured":"Harel D.: Hamiltonian paths in infinite graphs. Israel J. Math. 76, 317\u2013336 (1991)","journal-title":"Israel J. Math."},{"issue":"4","key":"359_CR6","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1305\/ndjfl\/1040046141","volume":"37","author":"J. Hirst","year":"1996","unstructured":"Hirst J., Lempp S.: Infinite versions of some problems from finite complexity theory. Notre Dame J. Formal Logic 37(4), 545\u2013553 (1996)","journal-title":"Notre Dame J. Formal Logic"},{"key":"359_CR7","unstructured":"Riege, T.: The Domatic Number Problem: Boolean Hierarchy Completeness and Exact Exponential-Time Algorithms, Ph.D. Dissertation, Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf (2006)"},{"key":"359_CR8","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr","year":"1987","unstructured":"Rogers H. Jr: Theory of Recursive Functions and Effective Computability. The MIT Press, Cambridge (1987)"},{"key":"359_CR9","volume-title":"Subsystems of Second Order Arithmetic","author":"G. Simpson S.","year":"1998","unstructured":"Simpson S. G.: Subsystems of Second Order Arithmetic. Springer, New York (1998)"},{"key":"359_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic","author":"R.I. Soare","year":"1987","unstructured":"Soare R.I.: Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer, New York (1987)"},{"issue":"2","key":"359_CR11","first-page":"145","volume":"33","author":"B. Zelinka","year":"1983","unstructured":"Zelinka B.: Domatic number and degrees of vertices of a graph. Mathematica Slovaca 33(2), 145\u2013147 (1983)","journal-title":"Mathematica Slovaca"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-013-0359-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-013-0359-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-013-0359-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T21:05:09Z","timestamp":1564520709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-013-0359-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,20]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["359"],"URL":"https:\/\/doi.org\/10.1007\/s00153-013-0359-2","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,20]]}}}