Key points are not available for this paper at this time.
Abstract Given a simple graph G , we ask when V ( G ) may be partitioned into two sets such that every vertex has an equal number of neighbors from each set. We establish a number of results for common families of graphs and completely classify 4-regular circulants which posses this property.
Freyberg et al. (Tue,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: