The existence of uniquely −G colourable graphs
- 15 January 1998
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 179 (1-3) , 1-11
- https://doi.org/10.1016/s0012-365x(97)00022-8
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The complexity of G-free colourabilityDiscrete Mathematics, 1997
- The complexity of generalized graph coloringsDiscrete Applied Mathematics, 1996
- ON UNIQUELY -G k-COLOURABLE GRAPHSQuaestiones Mathematicae, 1992
- Graph properties and hypergraph colouringsDiscrete Mathematics, 1991
- A ramsey type problem concerning vertex colouringsJournal of Combinatorial Theory, Series B, 1991
- A Construction of Uniquely C 4 -free colourable GraphsQuaestiones Mathematicae, 1990
- The subchromatic number of a graphDiscrete Mathematics, 1989
- On generalized graph coloringsJournal of Graph Theory, 1987
- Uniquely Partitionable GraphsJournal of the London Mathematical Society, 1977
- Uniquely Colourable Graphs with Large GirthCanadian Journal of Mathematics, 1976