A Construction of Uniquely C 4 -free colourable Graphs
- 1 January 1990
- journal article
- research article
- Published by Taylor & Francis in Quaestiones Mathematicae
- Vol. 13 (2) , 259-264
- https://doi.org/10.1080/16073606.1990.9631616
Abstract
An F-free colouring of a graph G is a partition {V1,V2,…,Vn} of the vertex set V(G) of G such that F is not an induced subgraph of G[Vi] for each i. A graph is uniquely F-free colourable if any two .F-free colourings induce the same partition of V(G). We give a constructive proof that uniquely C4-free colourable graphs exist.Keywords
This publication has 1 reference indexed in Scilit:
- On generalized graph coloringsJournal of Graph Theory, 1987