𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph Orientations with Edge-connection and Parity Constraints

✍ Scribed by András Frank; Zoltán Király

Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
334 KB
Volume
22
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balanced graphs with edge density constr
Balanced graphs with edge density constraints
✍ John Sheehan 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 400 KB

## Abstract Suppose that __G__ is a finite simple graph with |__V__(__G__)| = 2__n__ (__n__ ≠ 3). a partition (__X,Y__) of __V__(__G__) is balanced if (i) |__X__| = |__Y__| = __n__, (ii) δ(__X__) ≥ 1, δ(__Y__) ≥ 1. Where δ(__X__) is the minimum degree of the induced subgraph 〈X〉 with vertex set

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