5 citations · 5 across the 1 of their papers we have counts for
1 paper · 1 filter
Anna Fiedorowicz, Elżbieta Sidorowicz
A k-colouring (not necessarily proper) of vertices of a graph is called {\it acyclic}, if for every pair of distinct colours i and j the subgraph induced by the edges whose e…