{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T15:05:12Z","timestamp":1746803112935,"version":"3.40.5"},"reference-count":20,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,7,28]],"date-time":"2015-07-28T00:00:00Z","timestamp":1438041600000},"content-version":"vor","delay-in-days":1488,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1016\/j.dam.2011.04.006","type":"journal-article","created":{"date-parts":[[2011,5,22]],"date-time":"2011-05-22T10:13:37Z","timestamp":1306059217000},"page":"1293-1301","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["The<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C<\/mml:mi><\/mml:mrow><mml:mrow><mml:mi>k<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:math>-extended graft construction"],"prefix":"10.1016","volume":"159","author":[{"given":"Gary","family":"MacGillivray","sequence":"first","affiliation":[]},{"given":"Jacobus","family":"Swarts","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.dam.2011.04.006_br000005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(90)90017-7","article-title":"The effect of two cycles on the complexity of colourings by directed graphs","volume":"26","author":"Bang-Jensen","year":"1990","journal-title":"Discrete Appl. Math."},{"issue":"A","key":"10.1016\/j.dam.2011.04.006_br000010","first-page":"175","article-title":"On the complexity of colouring by digraphs with at most one directed cycle","volume":"35","author":"Bang-Jensen","year":"1993","journal-title":"Ars Combin."},{"issue":"20","key":"10.1016\/j.dam.2011.04.006_br000015","doi-asserted-by":"crossref","first-page":"2675","DOI":"10.1016\/j.disc.2010.03.033","article-title":"The complexity of colouring by locally semicomplete digraphs","volume":"310","author":"Bang-Jensen","year":"2010","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2011.04.006_br000020","doi-asserted-by":"crossref","unstructured":"Andrei A. Bulatov, Tractable conservative constraint satisfaction problems, in: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, 2003, pp. 321\u2013330.","DOI":"10.1109\/LICS.2003.1210072"},{"issue":"3","key":"10.1016\/j.dam.2011.04.006_br000025","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1137\/S0097539700376676","article-title":"Classifying the complexity of constraints using finite algebras","volume":"34","author":"Bulatov","year":"2005","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.dam.2011.04.006_br000030","series-title":"DIMAP Workshop on Algorithmic Graph Theory","first-page":"83","article-title":"Adjusted interval digraphs","volume":"vol. 32","author":"Feder","year":"2009"},{"issue":"1","key":"10.1016\/j.dam.2011.04.006_br000035","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/S0097539794266766","article-title":"The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory","volume":"28","author":"Feder","year":"1999","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.dam.2011.04.006_br000040","doi-asserted-by":"crossref","first-page":"1624","DOI":"10.1137\/060668316","article-title":"Minimum cost homomorphisms to semicomplete bipartite digraphs","volume":"22","author":"Gutin","year":"2008","journal-title":"SIAM J. Discrete Math."},{"issue":"12","key":"10.1016\/j.dam.2011.04.006_br000045","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1016\/j.dam.2007.09.023","article-title":"Minimum cost homomorphisms to semicomplete multipartite digraphs","volume":"156","author":"Gutin","year":"2008","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.dam.2011.04.006_br000050","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(92)90294-K","article-title":"Polynomial graph-colorings","volume":"35","author":"Gutjahr","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2011.04.006_br000055","series-title":"Graphs and Homomorphisms","volume":"vol. 28","author":"Hell","year":"2004"},{"key":"10.1016\/j.dam.2011.04.006_br000060","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.cosrev.2008.10.003","article-title":"Colouring, constraint satisfaction, and complexity","volume":"2","author":"Hell","year":"2008","journal-title":"Comput. Sci. Rev."},{"issue":"4","key":"10.1016\/j.dam.2011.04.006_br000065","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1090\/S0002-9947-96-01537-1","article-title":"Duality and polynomial testing of tree homomorphisms","volume":"348","author":"Hell","year":"1996","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.dam.2011.04.006_br000070","unstructured":"Pavol Hell, Arash Rafiey, The dichotomy of list homomorphisms for digraphs. Available at: http:\/\/arXiv.org\/abs\/1004.2908."},{"issue":"1\u20132","key":"10.1016\/j.dam.2011.04.006_br000075","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0304-3975(97)00230-2","article-title":"On the algebraic structure of combinatorial problems","volume":"200","author":"Jeavons","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2011.04.006_br000080","series-title":"Principles and Practice of Constraint Programming\u2014CP\u201995","first-page":"276","article-title":"A unifying framework for tractable constraints","volume":"vol. 976","author":"Jeavons","year":"1995"},{"key":"10.1016\/j.dam.2011.04.006_br000085","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/j.dam.2011.04.006_br000090","unstructured":"Gary MacGillivray, Jacobus Swarts, Weak near-unanimity functions and digraph homomorphism problems, Theoret. Comput. Sci. (submitted for publication)."},{"issue":"3\u20134","key":"10.1016\/j.dam.2011.04.006_br000095","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s00012-008-2122-9","article-title":"Existence theorems for weakly symmetric operations","volume":"59","author":"Mar\u00f3ti","year":"2008","journal-title":"Algebra Universalis"},{"key":"10.1016\/j.dam.2011.04.006_br000100","unstructured":"Jacobus Swarts, The complexity of digraph homomorphisms: local tournaments, injective homomorphisms and polymorphisms, Ph.D. Thesis, University of Victoria, 2008."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X11001363?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X11001363?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T19:14:55Z","timestamp":1741202095000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X11001363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":20,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["S0166218X11001363"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2011.04.006","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2011,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The -extended graft construction","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2011.04.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2011 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}