The Complexity of Colouring by Semicomplete Digraphs
- 1 August 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 1 (3) , 281-298
- https://doi.org/10.1137/0401029
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- 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
- Graph Theory with ApplicationsPublished by Springer Nature ,1976