On the complexity of colouring by superdigraphs of bipartite graphs
- 1 November 1992
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 109 (1-3) , 27-44
- https://doi.org/10.1016/0012-365x(92)90276-l
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Polynomial graph-coloringsDiscrete Applied Mathematics, 1992
- On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive DigraphsSIAM Journal on Discrete Mathematics, 1991
- 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
- On the complexity of the general coloring problemInformation and Control, 1981
- On classes of relations and graphs determined by subobjects and factorobjectsDiscrete Mathematics, 1978