Courcelle, B. (1994) The Monadic Second Order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures. Discrete Applied Mathematics, 54, 117-149. https://doi.org/10.1016/0166-218X(94)90019-1
[2]
MacGillivray, G., Raspaud, A. and Swarts, J. (2009) Injective Oriented Colourings. Graph Theoretic Concepts in Computer Science, 35th International Workshop WG, Lecture Notes in Computer Science, Vol. 5911, Montpellier, 24-26 June 2009, 262-272. https://doi.org/10.1007/978-3-642-11409-0_23
[3]
MacGillivray, G., Raspaud, A. and Swarts, J. (2011) Obstructions to Injective Oriented Colourings. Proceedings of EuroComb 2011, Electronic Notes in Discrete Mathematics, Vol. 38, Budapest, 29 August-2 September 2011, 597-605. https://doi.org/10.1016/j.endm.2011.10.001
[4]
MacGillivray, G., Raspaud, A. and Swarts, J. (2014) Obstructions to Locally Injective Oriented Improper Colourings. European Journal of Combinatorics, 35, 402-412. https://doi.org/10.1016/j.ejc.2013.06.023
[5]
MacGillivray, G. and Swarts, J. (2010) The Complexity of Locally Injective Homomorphisms. Discrete Mathematics, 310, 2685-2696. https://doi.org/10.1016/j.disc.2010.03.034
[6]
Swarts, J. (2008) The Complexity of Digraph Homomorphisms: Local Tournaments, Injective Homomorphisms and Polymorphisms. Ph.D. Thesis, University of Victoria, Victoria.
[7]
Campbell, R.J. (2009) Reflexive Injective Oriented Colourings. M.Sc. Thesis, University of Victoria, Victoria, BC, Canada.
[8]
Campbell, R.J., Clarke, N. and MacGillivray, G. (2022) Obstructions to Some Injective Oriented Colourings. https://arxiv.org/abs/2207.12523v1
[9]
Hahn, G., Kratochvil, J., Širáň, J. and Sotteau, D. (2002) On the Injective Chromatic Number of Graphs. Discrete Mathematics, 256, 179-192. https://doi.org/10.1016/S0012-365X(01)00466-6
[10]
Hell, P., Raspaud, A. and Stacho, J. (2008) On Injective Colourings of Chordal Graphs. In: Laber, E.S., et al., Eds., LATIN 2008: Theoretical Informatics, Lecture Notes in Computer Science Vol. 4957, Springer, Berlin, 520-530. https://doi.org/10.1007/978-3-540-78773-0_45
[11]
Kratochvíl, J. and Siggers, M. (2014) Locally Injective k-Colourings of Planar Graphs. Discrete Applied Mathematics, 173, 53-61. https://doi.org/10.1016/j.dam.2014.03.020
[12]
Fiala, J. and Kratochvíl, J. (2006) Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. In: Fomin, F.V., Ed., Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 4271, Springer, Berlin, 15-26. https://doi.org/10.1007/11917496_2
[13]
Fiala, J., Kratochvíl, J. and Pór, A. (2008) On the Computational Complexity of Partial Covers of Theta Graphs. Discrete Applied Mathematics, 156, 1143-1149. https://doi.org/10.1016/j.dam.2007.05.051
[14]
Fiala, J., Paulusma, D. and Telle, J.A. (2008) Locally Constrained Graph Homomorphisms and Equitable Partitions. European Journal of Combinatorics, 29, 850-880. https://doi.org/10.1016/j.ejc.2007.11.006
[15]
Bang-Jensen, J., Hell, P. and MacGillivray, G. (1988) The Complexity of Colourings by Semicomplete Digraphs. SIAM Journal on Discrete Mathematics, 1, 291-298. https://doi.org/10.1137/0401029
[16]
Hell, P. and Nešetřil, J. (2004) Graphs and Homomorphisms. Oxford Lecture Series in Mathematics and Its Applications, Vol. 28, Oxford University Press, Oxford.
[17]
Holyer, I. (1981) The NP-Completeness of Edge-Coloring. SIAM Journal on Computting, 10, 718-720. https://doi.org/10.1137/0210055
[18]
Garey, M.R., Johnson, D.S. and Stockmeyer, L. (1976) Some Simplified NP-Complete Graph Problems. Theoretical Computer Science, 1, 237-267. https://doi.org/10.1016/0304-3975(76)90059-1
