On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs
- 1 August 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 4 (3) , 397-408
- https://doi.org/10.1137/0404035
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- The effect of two cycles on the complexity of colourings by directed graphsDiscrete Applied Mathematics, 1990
- 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
- Contractibility and NP‐completenessJournal of Graph Theory, 1987
- Color-families are denseTheoretical Computer Science, 1982
- 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