Back to Search
Start Over
On the NP-completeness of the k-colorability problem for triangle-free graphs
- Source :
- Discrete Mathematics; 1996, Vol. 162 Issue: 1 p313-318, 6p
- Publication Year :
- 1996
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 162
- Issue :
- 1
- Database :
- Supplemental Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Periodical
- Accession number :
- ejs2473203
- Full Text :
- https://doi.org/10.1016/S0012-365X(97)89267-9