On the Complexity of Digraph Colourings and Vertex Arboricity

Winfried Hochstättler, Felix Schröder, Raphael Steiner. On the Complexity of Digraph Colourings and Vertex Arboricity. Discrete Mathematics & Theoretical Computer Science, 22(1), 2020. [doi]

@article{HochstattlerSS20,
  title = {On the Complexity of Digraph Colourings and Vertex Arboricity},
  author = {Winfried Hochstättler and Felix Schröder and Raphael Steiner},
  year = {2020},
  url = {http://dmtcs.episciences.org/6020},
  researchr = {https://researchr.org/publication/HochstattlerSS20},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics & Theoretical Computer Science},
  volume = {22},
  number = {1},
}