𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the existence of super edge-connected graphs with prescribed degrees

✍ Scribed by Tian, Yingzhi; Meng, Jixiang; Lai, Hongjian; Zhang, Zhao

Book ID
122237925
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
393 KB
Volume
328
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On existence of hypergraphs with prescri
On existence of hypergraphs with prescribed edge degree profile
✍ Mirko HorňÑk; Rudolf Lauff; Roman SotΓ‘k πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 518 KB

The degree profile of an edge e of a finite hypergraph H is the map assigning to a positive integer i the number of vertices of degree i incident with e. The edge degree profile of H is the map describing for any possible degree profile ~ the number of edges in H with degree profile ~. A necessary a

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