In this work we study the k-defect polynomials of a graph G. The k defect polynomial is a
function in λ that gives the number of improper colourings of a graph using λ colours. The k …

In this work we introduce and study an intersection graph of a graph G, with vertex set the
minimum edge-cuts of G. We start our study of this new graph by finding the minimum cut-set …