4 citations · 4 across the 1 of their papers we have counts for
1 paper
Jeannette Janssen, Kyle MacKeigan
A graph is k-total colourable if there is an assignment of k different colours to the vertices and edges of the graph such that no two adjacent nor incident elements receive the sa…