✦ LIBER ✦

Graph Decomposition with Constraints on Connectivity and Minimum Degree

✍ Scribed by JOHN SHEEHAN

Book ID: 119862800
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 256 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16432.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph decomposition with constraints on

Graph decomposition with constraints on the connectivity and minimum degree

✍ Carsten Thomassen 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

## Abstract For each pair __s,t__ of natural numbers there exist natural numbers __f(s,t)__ and __g(s,t)__ such that the vertex set of each graph of connectivity at least __f(s,t)__ (respectively minimum degree at least __g(s,t))__ has a decomposition into sets which induce subgraphs of connectivit

Graph decomposition with constraints on

Graph decomposition with constraints on the minimum degree

✍ John Sheehan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 888 KB

Let G be a finite simple graph on n vertices with minimum degree 6(G) 3 6 (n = 6 (mod 2)). Let max(k, G) denote the set of all k-subsets A E V(G) such that the number of edges in the induced subgraph (A) is a maximum. We prove that for some i E (0, 1.2, . . . ). Analogous edge density constraints, r

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 (

Balanced graphs with minimum degree cons

Balanced graphs with minimum degree constraints

✍ John Sheehan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Sheehan, J., Balanced graphs with minimum degree constraints, Discrete Mathematics 102 (1992) 307-314. Let G be a finite simple graph on n vertices with minimum degree 6 = 6(G) (n = 6 (mod 2)). Suppose that 0 < 6 c n -2, 06 i 4 [?Sl. A partition (x, Y) of V(G) is said to be an (i, a)-partition of G

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