{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:24:52Z","timestamp":1725582292132},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642193903"},{"type":"electronic","value":"9783642193910"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19391-0_9","type":"book-chapter","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T04:53:35Z","timestamp":1303966415000},"page":"116-126","source":"Crossref","is-referenced-by-count":0,"title":["On the General Coloring Problem"],"prefix":"10.1007","author":[{"given":"N. W.","family":"Sauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(81)90226-6","volume":"51","author":"H.A. Maurer","year":"1981","unstructured":"Maurer, H.A., Sudborough, J.H., Welzl, E.: On the complexity of the general coloring problem. Inform. and Control\u00a051, 123\u2013145 (1981)","journal-title":"Inform. and Control"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0166-218X(81)90037-8","volume":"3","author":"H.A. Maurer","year":"1981","unstructured":"Maurer, H.A., Salomaa, A., Wood, D.: Colorings and interpretations: a connection between graphs and grammar forms. Discrete Appl. Math.\u00a03, 119\u2013135 (1981)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/322290.322298","volume":"29","author":"H.A. Maurer","year":"1982","unstructured":"Maurer, H.A., Salomaa, A., Wood, D.: Dense hierarchies of grammatical families. J. ACM\u00a029(1), 118\u2013126 (1982)","journal-title":"J. ACM"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1145\/322290.322298","volume":"29","author":"H.A. Maurer","year":"1982","unstructured":"Maurer, H.A., Salomaa, A., Wood, D.: Dense hierarchies of grammatical families. J. Assoc. Comput. Mach.\u00a029(1), 118\u2013126 (1982)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0012-365X(94)00298-W","volume":"152","author":"D. Duffus","year":"1996","unstructured":"Duffus, D., Sauer, N.: Lattices arising in categorical investigations of Hedetniemi\u2019s conjecture. Discrete Math.\u00a0152, 125\u2013139 (1996)","journal-title":"Discrete Math."},{"key":"9_CR6","volume-title":"Distributive Lattices","author":"R. Balbes","year":"1974","unstructured":"Balbes, R., Dwinger, P.: Distributive Lattices. University of Missouri Press, Columbia (1974)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1215\/S0012-7094-42-00921-9","volume":"12","author":"G. Birkhoff","year":"1942","unstructured":"Birkhoff, G.: Generalized arithmetic. Duke Math. J.\u00a012, 283\u2013302 (1942)","journal-title":"Duke Math. J."},{"unstructured":"Rutherford, D.E.: Introduction to Lattice Theory. Oliver and Boyd (1965)","key":"9_CR8"},{"doi-asserted-by":"crossref","unstructured":"Gierz, G., Hoffmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous Lattices and Domains. Encyclopedia of Mathematics and its Applications\u00a093 (2003)","key":"9_CR9","DOI":"10.1017\/CBO9780511542725"},{"issue":"7","key":"9_CR10","first-page":"722","volume":"8","author":"W. Kuich","year":"2002","unstructured":"Kuich, W., Sauer, N., Urbanek, F.: Heyting Algebras and Formal Languages. J. of Universal Computer Science\u00a08(7), 722\u2013736 (2002)","journal-title":"J. of Universal Computer Science"},{"unstructured":"Tardif, C.: Hedetniemi\u2019s conjecture, 40 years later. Graph Theory Notes of New York LIV, pp. 46\u201357. New York Academy of Sciences (2008)","key":"9_CR11"},{"issue":"1","key":"9_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.11650\/twjm\/1500406890","volume":"2","author":"X. Zhu","year":"1998","unstructured":"Zhu, X.: A survey on Hedetniemi\u2019s conjecture. Taiwanese Journal of Mathematics\u00a02(1), 1\u201324 (1998)","journal-title":"Taiwanese Journal of Mathematics"},{"issue":"1-3","key":"9_CR13","first-page":"261","volume":"229","author":"N. Sauer","year":"2001","unstructured":"Sauer, N.: Hedetniemis Conjecture\u2013a survey. Combinatorics, graph theory, algorithms and applications. Discrete Math.\u00a0229(1-3), 261\u2013292 (2001)","journal-title":"Combinatorics, graph theory, algorithms and applications. Discrete Math."},{"unstructured":"Foniok, J., Ne\u0161et\u0159il, J., Pultr, A., Tardif, C.: Dualities and Dual Pairs in Heyting Algebras. Order. arXiv:0908.0428v1 (July 16, 2010)","key":"9_CR14"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.ejc.2007.11.017","volume":"29","author":"J. Foniok","year":"2008","unstructured":"Foniok, J., Ne\u0161et\u0159il, J., Tardif, C.: Generalised dualities and maximal finite antichains in the homomorphism order of relational structures. European J. Combin.\u00a029(4), 881\u2013899 (2008)","journal-title":"European J. Combin."},{"issue":"1","key":"9_CR16","first-page":"9","volume":"48","author":"J. Ne\u0161et\u0159il","year":"2007","unstructured":"Ne\u0161et\u0159il, J., Pultr, A., Tardif, C.: Gaps and dualities in Heyting categories. Comment. Math. Univ. Carolin.\u00a048(1), 9\u201323 (2007)","journal-title":"Comment. Math. Univ. Carolin."},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1006\/jctb.2000.1970","volume":"80","author":"J. Ne\u0161et\u0159il","year":"2000","unstructured":"Ne\u0161et\u0159il, J., Tardif, C.: Duality theorems for finite structures (characterising gaps and good characterisations). J. Combin. Theory Ser. B\u00a080(1), 80\u201397 (2000)","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Rainbow of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19391-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:41:25Z","timestamp":1558575685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19391-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642193903","9783642193910"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19391-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}