A Construction of Uniquely C4-free colourable Graphs

作者： Izak Broere , Jason I. Brown , Gerhard Benadé

DOI: 10.1080/16073606.1990.9631616

关键词:

摘要: Abstract An F-free colouring of a graph G is partition {V1,V2,…,Vn} the vertex set V(G) such that F not an induced subgraph G[Vi] for each i. A uniquely colourable if any two .F-free colourings induce same V(G). We give constructive proof C4-free graphs exist.