The effect of two cycles on the complexity of colourings by directed graphs
- 1 January 1990
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 26 (1) , 1-23
- https://doi.org/10.1016/0166-218x(90)90017-7
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The Complexity of Colouring by Semicomplete DigraphsSIAM Journal on Discrete Mathematics, 1988
- On multiplicative graphs and the product conjectureCombinatorica, 1988
- On unavoidable digraphs in orientations of graphsJournal of Graph Theory, 1987
- On the complexity of the general coloring problemInformation and Control, 1981
- On classes of relations and graphs determined by subobjects and factorobjectsDiscrete Mathematics, 1978