{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T11:55:56Z","timestamp":1774439756129,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642114083","type":"print"},{"value":"9783642114090","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_23","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"262-272","source":"Crossref","is-referenced-by-count":3,"title":["Injective Oriented Colourings"],"prefix":"10.1007","author":[{"given":"Gary","family":"MacGillivray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacobus","family":"Swarts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"Graph Theory","author":"J.A. Bondy","year":"2007","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2007)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0166-218X(94)90019-1","volume":"54","author":"B. Courcelle","year":"1994","unstructured":"Courcelle, B.: The monadic second order logic of graphs VI: On several reresentations of graphs by relational structures. Discrete Appl. Math.\u00a054, 117\u2013149 (1994); Erratum: Discrete Appl. Math. 63, 199\u2013200 (1995)","journal-title":"Discrete Appl. Math."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.ipl.2006.09.007","volume":"101","author":"L. Esperet","year":"2007","unstructured":"Esperet, L., Ochem, P.: Oriented colorings of 2-outerplanar graphs. Inform. Process. Lett.\u00a0101, 215\u2013219 (2007)","journal-title":"Inform. Process. Lett."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T. Feder","year":"1998","unstructured":"Feder, T., Vardi, M.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM J. Comput\u00a028, 57\u2013104 (1998)","journal-title":"SIAM J. Comput"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/11549345_29","volume-title":"Mathematical Foundations of Computer Science 2005","author":"G. Fertin","year":"2005","unstructured":"Fertin, G., Rizzi, R., Vialette, S.: Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 328\u2013339. Springer, Heidelberg (2005)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/11917496_2","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Fiala","year":"2006","unstructured":"Fiala, J., Kratochvil, J.: Locally injective graph homomorphism: lists guarantee dichotomy. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 15\u201326. Springer, Heidelberg (2006)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1016\/j.dam.2007.05.051","volume":"156","author":"J. Fiala","year":"2008","unstructured":"Fiala, J., Kratochvil, J., Por, A.: On the computational complexity of partial covers of theta graphs. Discrete Appl. Math.\u00a0156, 1143\u20131149 (2008)","journal-title":"Discrete Appl. Math."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0012-365X(01)00466-6","volume":"256","author":"G. Hahn","year":"2002","unstructured":"Hahn, G., Kratochvil, J., S\u00ed\u0159an, J., Sotteau, D.: On the injective chromatic number of graphs. Discrete Math.\u00a0256, 179\u2013192 (2002)","journal-title":"Discrete Math."},{"key":"23_CR9","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P. Hell","year":"2004","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford University Press, London (2004)"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.7151\/dmgt.1237","volume":"24","author":"W. Klostermeyer","year":"2004","unstructured":"Klostermeyer, W., MacGillivray, G.: Analogues of cliques for oriented colouring. Discussions Mathematicae Graph Theory\u00a024, 373\u2013387 (2004)","journal-title":"Discussions Mathematicae Graph Theory"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"MacGillivray, G. , Raspaud, A. and Swarts, J.: Injective Oriented Colourings II (Manuscript) (2009)","DOI":"10.1007\/978-3-642-11409-0_23"},{"key":"23_CR12","unstructured":"MacGillivray, G., Swarts, J.: The complexity of injective homomorphisms (Submitted) (2008)"},{"key":"23_CR13","volume-title":"Topics on Tournaments","author":"J.W. Moon","year":"1968","unstructured":"Moon, J.W.: Topics on Tournaments. Holt, Rinehart and Winston, New York (1968)"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(94)00088-3","volume":"51","author":"A. Raspaud","year":"1994","unstructured":"Raspaud, A., Sopena, E.: Good and semi-strong colorings of oriented planar graphs. Information Processing Letters\u00a051, 171\u2013174 (1994)","journal-title":"Information Processing Letters"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0012-365X(00)00216-8","volume":"229","author":"E. Sopena","year":"2001","unstructured":"Sopena, E.: Oriented graph coloring. Discrete Math.\u00a0229, 359\u2013369 (2001)","journal-title":"Discrete Math."},{"key":"23_CR16","unstructured":"Swarts, J.: The complexity of digraph homomorphisms: Local tournaments, Injective Homomorphisms and Polymorphisms. Ph.D. Thesis, Department of Mathematics and Statistics, University of Victoria, Victoria, BC, Canada (2008)"},{"key":"23_CR17","first-page":"37","volume":"7","author":"D. Wood","year":"2005","unstructured":"Wood, D.: Acyclic, star and oriented colourings of graph subdivisions. Discrete Math. Theor. Comput. Sci.\u00a07, 37\u201350 (2005)","journal-title":"Discrete Math. Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:20Z","timestamp":1606185620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}