An optimal algorithm for computing Frieze – Kannan regular partitions

In this paper we prove that two local conditions involving the degrees and co-degrees in a graph can be used to determine whether a given vertex partition is Frieze–Kannan-regular. With a more refined version of these two local conditions we provide a deterministic algorithm that obtains a Frieze–Kanan-regular partition of any graph G in time O(|V (G)|).