{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:20:12Z","timestamp":1759335612962},"reference-count":11,"publisher":"Elsevier BV","issue":"20","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,10,28]],"date-time":"2014-10-28T00:00:00Z","timestamp":1414454400000},"content-version":"vor","delay-in-days":1488,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1016\/j.disc.2010.03.033","type":"journal-article","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T04:53:04Z","timestamp":1273207984000},"page":"2675-2684","source":"Crossref","is-referenced-by-count":4,"title":["The complexity of colouring by locally semicomplete digraphs"],"prefix":"10.1016","volume":"310","author":[{"given":"J\u00f8rgen","family":"Bang-Jensen","sequence":"first","affiliation":[]},{"given":"Gary","family":"MacGillivray","sequence":"additional","affiliation":[]},{"given":"Jacobus","family":"Swarts","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.disc.2010.03.033_b1","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1002\/jgt.3190140310","article-title":"Locally semicomplete digraphs: a generalization of tournaments","volume":"14","author":"Bang-Jensen","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2010.03.033_b2","series-title":"Digraphs: Theory, Algorithms and Applications","author":"Bang-Jensen","year":"2009"},{"issue":"1","key":"10.1016\/j.disc.2010.03.033_b3","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":"3","key":"10.1016\/j.disc.2010.03.033_b4","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0401029","article-title":"The complexity of colouring by semicomplete digraphs","volume":"1","author":"Bang-Jensen","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2010.03.033_b5","unstructured":"J\u00f8rgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts, A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles (in preparation)."},{"issue":"5","key":"10.1016\/j.disc.2010.03.033_b6","doi-asserted-by":"crossref","first-page":"1782","DOI":"10.1137\/070708093","article-title":"The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell)","volume":"38","author":"Barto","year":"2008","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.disc.2010.03.033_b7","series-title":"A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences","article-title":"Computers and intractability","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/j.disc.2010.03.033_b8","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."},{"issue":"1","key":"10.1016\/j.disc.2010.03.033_b9","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-coloring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2010.03.033_b10","article-title":"Graphs and Homomorphisms","volume":"vol. 28","author":"Hell","year":"2004"},{"issue":"4","key":"10.1016\/j.disc.2010.03.033_b11","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1002\/jgt.3190200410","article-title":"On homomorphisms to acyclic local tournaments","volume":"20","author":"Hell","year":"1995","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X10001123?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X10001123?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,11]],"date-time":"2018-12-11T04:54:48Z","timestamp":1544504088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X10001123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":11,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["S0012365X10001123"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2010.03.033","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2010,10]]}}}