𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Thek-Restricted Edge Connectivity of Balanced Bipartite Graphs

✍ Scribed by Jun Yuan; Aixia Liu


Book ID
106047902
Publisher
Springer Japan
Year
2010
Tongue
English
Weight
220 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Minimally restricted edge connected grap
✍ Yanmei Hong; Qinghai Liu; Zhao Zhang πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 176 KB

For a connected graph G = (V, E), an edge set S βŠ‚ E is a restricted edge cut if G -S is disconnected and there is no isolated vertex in G -S. The cardinality of a minimum restricted edge cut of G is the restricted edge connectivity of G, denoted by Ξ» (G). , where ΞΎ(G) is the minimum edge degree of

Balanced coloring of bipartite graphs
✍ Uriel Feige; Shimon Kogan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 128 KB

## Abstract Given a bipartite graph __G__(__U__βˆͺ__V, E__) with __n__ vertices on each side, an independent set __I__∈__G__ such that |__U__∩__I__|=|__V__∩__I__| is called a balanced bipartite independent set. A balanced coloring of __G__ is a coloring of the vertices of __G__ such that each color c