NP-completeness of a family of graph-colouring problems
- 31 January 1983
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 5 (1), 111-117
- https://doi.org/10.1016/0166-218x(83)90020-3
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Set colourings of graphsDiscrete Mathematics, 1979
- Kneser's conjecture, chromatic number, and homotopyJournal of Combinatorial Theory, Series A, 1978
- r-tuple colorings of uniquely colorable graphsDiscrete Mathematics, 1976
- n-Tuple colorings and associated graphsJournal of Combinatorial Theory, Series B, 1976
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- A (<5)-Colour Theorem for Planar GraphsBulletin of the London Mathematical Society, 1973
- The footballers of CroamJournal of Combinatorial Theory, Series B, 1973
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1967
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961