{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:20Z","timestamp":1753893860986,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We investigate the apparent difficulty of finding domatic partitions in graphs using tools from computability theory.\u00a0 We consider nicely presented (i.e., computable) infinite graphs and show that even if the domatic number is known, there might not be any algorithm for producing a domatic partition of optimal size.\u00a0 However, we prove that smaller domatic partitions can be constructed if we restrict to regular graphs.\u00a0 Additionally, we establish similar results for total domatic partitions.<\/jats:p>","DOI":"10.37236\/5089","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:25:50Z","timestamp":1578669950000},"source":"Crossref","is-referenced-by-count":0,"title":["Finding Domatic Partitions in Infinite Graphs"],"prefix":"10.37236","volume":"22","author":[{"given":"Matthew","family":"Jura","sequence":"first","affiliation":[]},{"given":"Oscar","family":"Levin","sequence":"additional","affiliation":[]},{"given":"Tyler","family":"Markkanen","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2015,9,20]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i3p39\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i3p39\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:12:46Z","timestamp":1579255966000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v22i3p39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,20]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2015,7,1]]}},"URL":"https:\/\/doi.org\/10.37236\/5089","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2015,9,20]]},"article-number":"P3.39"}}