Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
Pointed Conflict-Free Colouring of Digraphs

Mahdieh Hasheminezhad

Volume 50, Issue 1 , June 2018, , Pages 119-131

https://doi.org/10.22059/jac.2018.68425

Abstract
  In a pointed conflict-free partial   (PCFP) colouring of a digraph, each vertex has at least  one in-neighbour with unique colour.  In this paper,  it is proved that PCFP $k$-colourability of digraphs is NP-complete,  for any $k >0$.  Nevertheless  for   ...  Read More