Obstructions to Injective Oriented Colourings

Bondy, 2007

Courcelle, 1994, The monadic second order logic of graphs VI: On several reresentations of graphs by relational structures, Discrete Appl. Math., 54, 117, 10.1016/0166-218X(94)90019-1

Esperetand, 2007, Oriented colorings of 2-outerplanar graphs, Inform. Process. Lett., 101, 215, 10.1016/j.ipl.2006.09.007

Feder, 1998, The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory, SIAM J. Comput, 28, 57, 10.1137/S0097539794266766

Fertin, 2005, Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs, vol. 3618, 328

Fiala, 2006, Locally injective graph homomorphism: lists guarantee dichotomy, Graph-theoretic concepts in computer science, vol. 4271, 15

Fiala, 2008, On the computational complexity of partial covers of theta graphs, Discrete Appl. Math., 156, 1143, 10.1016/j.dam.2007.05.051

Hahn, 2002, On the injective chromatic number of graphs, Discrete Math., 256, 179, 10.1016/S0012-365X(01)00466-6

Hell, 2004

MacGillivray, 2010, Injective Oriented Colourings, vol. 5911, 262

MacGillivray, 2010, The complexity of locally injective homomorphisms, Discrete Math., 310, 2685, 10.1016/j.disc.2010.03.034

Moon, 1968

Raspaud, 1994, Good and semi-strong colorings of oriented planar graphs, Information Processing Letters, 51, 171, 10.1016/0020-0190(94)00088-3

Sopena, 2001, Oriented graph coloring. Combinatorics, graph theory, algorithms and applications., Discrete Math., 229, 359, 10.1016/S0012-365X(00)00216-8

J. Swarts, The complexity of digraph homomorphisms: Local tournaments, Injective Homomorphisms and Polymorphisms, Ph.D. Thesis (2008), Department of Mathematics and Statistics, University of Victoria, Victoria, BC, Canada.

Wood, 2005, Acyclic, star and oriented colourings of graph subdivisions, Discrete Math. Theor. Comput. Sci., 7, 37, 10.46298/dmtcs.344