Graph partitions with minimum degree constraints

Esther M. Arkin; Refael Hassin

doi:10.1016/S0012-365X(98)00114-9

Graph partitions with minimum degree constraints

Esther M. Arkin, Refael Hassin^*

^*Corresponding author for this work

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

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).

Original language	English
Pages (from-to)	55-65
Number of pages	11
Journal	Discrete Mathematics
Volume	190
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(98)00114-9
State	Published - 28 Aug 1998

Access to Document

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

Cite this

@article{9299cf02f4854d3287cc5a751b7e7f42,

title = "Graph partitions with minimum degree constraints",

abstract = "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).",

author = "Arkin, {Esther M.} and Refael Hassin",

note = "Funding Information: * Corresponding author. E-mail: hassin@math.tau.ac.il. l Partially supported by NSF Grant CCR-9504192.",

year = "1998",

month = aug,

day = "28",

doi = "10.1016/S0012-365X(98)00114-9",

language = "אנגלית",

volume = "190",

pages = "55--65",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Graph partitions with minimum degree constraints

AU - Arkin, Esther M.

AU - Hassin, Refael

N1 - Funding Information: * Corresponding author. E-mail: hassin@math.tau.ac.il. 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 - מאמר

AN - SCOPUS:0041544238

VL - 190

SP - 55

EP - 65

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -

Graph partitions with minimum degree constraints

Abstract

Access to Document

Other files and links

Fingerprint

Cite this