{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:55:42Z","timestamp":1761807342669},"reference-count":15,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2008,5,1]],"date-time":"2008-05-01T00:00:00Z","timestamp":1209600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":1939,"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":[[2008,5]]},"DOI":"10.1016\/j.disc.2006.11.026","type":"journal-article","created":{"date-parts":[[2007,4,20]],"date-time":"2007-04-20T12:07:33Z","timestamp":1177070853000},"page":"1639-1652","source":"Crossref","is-referenced-by-count":16,"title":["On realizations of point determining graphs, and obstructions to full homomorphisms"],"prefix":"10.1016","volume":"308","author":[{"given":"Tom\u00e1s","family":"Feder","sequence":"first","affiliation":[]},{"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2006.11.026_bib1","unstructured":"R.N. Ball, J. Ne\u0161et\u0159il, A. Pultr, Dualities in full homomorphisms, Manuscript, 2006."},{"key":"10.1016\/j.disc.2006.11.026_bib2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0012-365X(74)90019-3","article-title":"Line-critical point determining and point distinguishing graphs","volume":"10","author":"Entringer","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2006.11.026_bib3","doi-asserted-by":"crossref","unstructured":"T. Feder, P. Hell, Matrix partitions of perfect graphs, Discrete Appl. Math. 306 (2006) 2450\u20132460.","DOI":"10.1016\/j.disc.2005.12.035"},{"key":"10.1016\/j.disc.2006.11.026_bib4","doi-asserted-by":"crossref","unstructured":"T. Feder, P. Hell, S. Klein, R. Motwani, Complexity of list partitions, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 464\u2013472.","DOI":"10.1145\/301250.301373"},{"key":"10.1016\/j.disc.2006.11.026_bib5","first-page":"449","article-title":"List partitions","volume":"16","author":"Feder","year":"2003","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.disc.2006.11.026_bib6","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.tcs.2005.09.030","article-title":"List matrix partitions of chordal graphs","volume":"349","author":"Feder","year":"2005","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.disc.2006.11.026_bib7","doi-asserted-by":"crossref","unstructured":"T. Feder, P. Hell, W. Xie, Matrix partitions with finitely many obstructions, Electronic Notes in Discrete Math. 28 (2007) 371\u2013 378.","DOI":"10.1016\/j.endm.2007.01.057"},{"key":"10.1016\/j.disc.2006.11.026_bib8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(78)90020-5","article-title":"The edge nucleus of a point-determining graph","volume":"24","author":"Geoffrey","year":"1978","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/j.disc.2006.11.026_bib9","doi-asserted-by":"crossref","unstructured":"P. Hell, From graph colouring to constraint satisfaction: there and back again, In: M. Klazar et al. (Eds.), Topics in Discrete Math., Dedicated to Jarik Ne\u0161et\u0159il on the Occasion of his 60th Birthday, Vol. 26, Springer series, Algorithms and Combinatorics, Springer, Berlin, 2006, pp. 407\u2013432.","DOI":"10.1007\/3-540-33700-8_20"},{"key":"10.1016\/j.disc.2006.11.026_bib10","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-colouring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/j.disc.2006.11.026_bib11","series-title":"Graphs and Homomorphisms","author":"Hell","year":"2004"},{"key":"10.1016\/j.disc.2006.11.026_bib12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(73)90109-X","article-title":"Point determination in graphs","volume":"5","author":"Sumner","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2006.11.026_bib13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0095-8956(74)90092-6","article-title":"1-factors of point determining graphs","volume":"16","author":"Sumner","year":"1974","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/j.disc.2006.11.026_bib14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(76)90010-8","article-title":"The nucleus of a point determining graph","volume":"14","author":"Sumner","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2006.11.026_bib15","unstructured":"W. Xie, Obstructions to trigraph homomorphisms, M.Sc. Thesis, Simon Fraser University, 2006."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X07002385?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X07002385?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T08:05:10Z","timestamp":1556352310000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X07002385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":15,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["S0012365X07002385"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2006.11.026","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2008,5]]}}}