TY - JOUR

T1 - Graph partitions with minimum degree constraints

AU - Arkin, Esther M.

AU - Hassin, Refael

N1 - Funding Information:
* Corresponding author. E-mail: [email protected]. l Partially supported by NSF Grant CCR-9504192.

PY - 1998/8/28

Y1 - 1998/8/28

N2 - Given a graph with n nodes and minimum degree δ, we give a polynomial time algorithm that constructs a partition of the nodes of the graph into two sets X and Y such that the sum of the minimum degrees in X and in Y is at least δ and the cardinalities of X and Y differ by at most δ (δ + 1 if n ≠ δ (mod 2)). The existence of such a partition was shown by Sheehan (1988).

AB - Given a graph with n nodes and minimum degree δ, we give a polynomial time algorithm that constructs a partition of the nodes of the graph into two sets X and Y such that the sum of the minimum degrees in X and in Y is at least δ and the cardinalities of X and Y differ by at most δ (δ + 1 if n ≠ δ (mod 2)). The existence of such a partition was shown by Sheehan (1988).

UR - http://www.scopus.com/inward/record.url?scp=0041544238&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(98)00114-9

DO - 10.1016/S0012-365X(98)00114-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0041544238

SN - 0012-365X

VL - 190

SP - 55

EP - 65

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -