𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitions of graphs with high minimum degree or connectivity

✍ Scribed by Daniela Kühn; Deryk Osthus

Book ID
108395398
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
203 KB
Volume
88
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph partitions with minimum degree con
Graph partitions with minimum degree constraints
✍ Esther M. Arkin; Refael Hassin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Given a graph with n nodes and minimum degree 6, 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 6 and the cardinalities of X and Y differ by at most 6 (6 + 1 if n ~ 6 (

On graphs with equal edge-connectivity a
On graphs with equal edge-connectivity and minimum degree
✍ Donald L. Goldsmith; Arthur T. White 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 599 KB

It was proved by Chartrand f hat if G is a graph of order p for which the minimum degree is at least [&I, then the edge-connectivity of G equals the minimum degree of G. It is shown here that one may allow vertices of degree less than $p and still obtain the same conclusion, provided the degrees are

On graphs with equal edge connectivity a
On graphs with equal edge connectivity and minimum degree
✍ Béla Bollobás 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 255 KB

If a grrrph G hao edge connectivity A then the vertex fiat ha a partition V(a) = U U W ash that 61 esntainti exactly A edgea from U to W, Wen~se if Qo ia a maximal graph of order n and edge connectivity A than C$, is sbtctined from the dkjsint union of two complete oubgragh8, B,[U] and &T,[ Wg, by a