|
Conference publicationsOn Locally-balancad 2-partitions of Some Bipartite GraphsNecessary and sufficient condition is obtained for the problem of such partitioning of the set of vertices of a bipartite graph G, in which arbitrary two simple cycles have at most one common vertex, into two disjoint subsets V1 and V2, which satisfies the condition ||λ(v)∩V1|‒|λ(v)∩V2|| ≤ 1 for any vertex v of G, where λ(v) is the set of all vertices of G adjacent to v. |
