The complexity of G-free colourability
- 15 March 1997
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 165-166, 21-30
- https://doi.org/10.1016/s0012-365x(97)84217-3
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The existence of uniquely −G colourable graphsDiscrete Mathematics, 1998
- ON UNIQUELY -G k-COLOURABLE GRAPHSQuaestiones Mathematicae, 1992
- On generalized graph coloringsJournal of Graph Theory, 1987
- Graphs with unique Ramsey coloringsJournal of Graph Theory, 1983
- Further Evidence Concerning Speech in Neandertal ManMan, 1976
- The point-arboricity of a graphIsrael Journal of Mathematics, 1968