1. Locally semicomplete digraphs: a generalization of tournaments;Bang-Jensen;J. Graph Theory,1990
2. Digraphs: Theory, Algorithms and Applications;Bang-Jensen,2009
3. The effect of two cycles on the complexity of colourings by directed graphs;Bang-Jensen;Discrete Appl. Math.,1990
4. The complexity of colouring by semicomplete digraphs;Bang-Jensen;SIAM J. Discrete Math.,1988
5. Jørgen Bang-Jensen, Gary MacGillivray, Jacobus Swarts, A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles (in preparation).