Hereditarily hard H-colouring problems
- 6 March 1995
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 138 (1-3) , 75-92
- https://doi.org/10.1016/0012-365x(94)00189-p
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Polynomial graph-coloringsPublished by Springer Nature ,2005
- On the complexity of colouring by superdigraphs of bipartite graphsDiscrete Mathematics, 1992
- Polynomial graph-coloringsDiscrete Applied Mathematics, 1992
- 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
- Contractibility and NP‐completenessJournal of Graph Theory, 1987
- On minimal graphsTheoretical Computer Science, 1982
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980