{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:40:02Z","timestamp":1746160802610,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_46","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"526-537","source":"Crossref","is-referenced-by-count":4,"title":["The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"Florent","family":"Foucaud","sequence":"first","affiliation":[]},{"given":"Reza","family":"Naserasr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier (2006)"},{"issue":"1","key":"46_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008647514949","volume":"8","author":"N. Alon","year":"1998","unstructured":"Alon, N., Marshall, T.H.: Homomorphisms of edge-colored graphs and Coxeter groups. J. Algebr. Combin.\u00a08(1), 5\u201313 (1998)","journal-title":"J. Algebr. Combin."},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/S1571-0653(05)80121-0","volume":"5","author":"R.C. Brewster","year":"2000","unstructured":"Brewster, R.C., Hell, P.: On homomorphisms to edge-coloured cycles. Electr. Notes Discrete Math.\u00a05, 46\u201349 (2000)","journal-title":"Electr. Notes Discrete Math."},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Bulatov, A.A.: A dichotomy constraint on a three-element set. In: Proc. 43rd IEEE Symposium on Theory of Computing, pp. 649\u2013658 (2002)","DOI":"10.1109\/SFCS.2002.1181990"},{"key":"46_CR5","unstructured":"Charpentier, C., Naserasr, R., Sopena, E.: Analogue of Jeager-Zhang conjecture for signed bipartite graphs (manuscript)"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"Demaine, E., Hajiaghayi, M., Kawarabayashi, K.-I.: Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. In: Proc. SODA 2010, pp. 329\u2013344 (2010)","DOI":"10.1137\/1.9781611973075.28"},{"issue":"1","key":"46_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The Computational structure of monotone monadic SNP and constraint catisfaction: a study through datalog and group theory. SIAM J. Comput.\u00a028(1), 57\u2013104 (1998)","journal-title":"SIAM J. Comput."},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jctb.2008.03.006","volume":"99","author":"J. Geelen","year":"2009","unstructured":"Geelen, J., Gerards, B., Reed, B., Seymour, P., Vetta, A.: On the odd-minor variant of Hadwigers conjecture. J. Combin. Theor. Series B\u00a099, 20\u201329 (2009)","journal-title":"J. Combin. Theor. Series B"},{"key":"46_CR9","unstructured":"Guenin, B.: Graphs without odd-K5 minors are 4-colourable. Talk at Oberwolfach Seminar on Graph Theory (January 2005)"},{"key":"46_CR10","unstructured":"Guenin, B.: Packing odd circuit covers: a conjecture (2005) (unpublished manuscript)"},{"issue":"1","key":"46_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-coloring. J. Combin. Theor. Series B\u00a048(1), 92\u2013110 (1990)","journal-title":"J. Combin. Theor. Series B"},{"key":"46_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0166-218X(96)00099-6","volume":"70","author":"P. Hell","year":"1996","unstructured":"Hell, P., Ne\u0161et\u0159il, J., Zhu, X.: Complexity of tree homomorphisms. Discrete Appl. Math.\u00a070, 23\u201336 (1996)","journal-title":"Discrete Appl. Math."},{"key":"46_CR13","unstructured":"Moret, B.M.E.: The Theory of Computation, ch. 7, Problem 7.1, Part 2. Addison-Wesley (1998)"},{"key":"46_CR14","unstructured":"Naserasr, R., Rollov\u00e1, E., Sopena, E.: Homomorphisms of signed graphs (submitted manuscript)"},{"issue":"1","key":"46_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","volume":"4","author":"T. Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graphs. Discrete Appl. Math.\u00a04(1), 47\u201374 (1982)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:23:09Z","timestamp":1746159789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}