𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum Directed Cuts in Graphs with Degree Constraints

✍ Scribed by Baogang Xu, Xingxing Yu

Book ID
113036253
Publisher
Springer Japan
Year
2011
Tongue
English
Weight
310 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximum directed cuts in digraphs with d
Maximum directed cuts in digraphs with degree restriction
✍ JenΓΆ Lehel; FrΓ©dΓ©ric Maffray; Myriam Preissmann πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 173 KB

## Abstract For integers __m, k__β‰₯1, we investigate the maximum size of a directed cut in directed graphs in which there are __m__ edges and each vertex has either indegree at most __k__ or outdegree at most __k__. Β© 2009 Wiley Periodicals, Inc. J Graph Theory

Maximum directed cuts in acyclic digraph
Maximum directed cuts in acyclic digraphs
✍ Noga Alon; BΓ©la BollobΓ‘s; AndrΓ‘s GyΓ‘rfΓ‘s; JenΕ‘ Lehel; Alex Scott πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 152 KB

## Abstract It is easily shown that every digraph with __m__ edges has a directed cut of size at least __m__/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of the largest directed cut in __acyclic__ digraphs, and prove a number of related results concerning cuts

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

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 (