Article citationsMore>>

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

has been cited by the following article:

• TITLE: Complexity of Injective Homomorphisms to Small Tournaments, and of Injective Oriented Colourings

  AUTHORS: Russell J. Campbell, Nancy E. Clarke, Gary MacGillivray

  KEYWORDS: Injective Graph Homomorphism, Oriented Colouring, Complexity

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.13 No.1, November 9, 2022

  ABSTRACT: Several possible definitions of local injectivity for a homomorphism of an oriented graph G to an oriented graph H are considered. In each case, we determine the complexity of deciding whether there exists such a homomorphism when G is given and H is a fixed tournament on three or fewer vertices. Each possible definition leads to a locally-injective oriented colouring problem. A dichotomy theorem is proved in each case.