𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A proof of the branching number bound for normal manifolds

✍ Scribed by Stefan Scholtes

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
771 KB
Volume
246
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A short proof of the degree bound for in
A short proof of the degree bound for interval number
✍ Douglas B. West πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 141 KB

A short proof is given of the fact that every graph has an interval representation of depth 2 in which each vertex u is represented by at most &f(u) + 11 intervals, except for an arbitrarily specified vertex w that appears left-most in the representation and is represented by at most [&d(w) + 1)1 in

Bounds for the harmonious chromatic numb
Bounds for the harmonious chromatic number of a graph
✍ I. Krasikov; Y. Roditty πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 231 KB πŸ‘ 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (__Journal of Graph Theory__, 1991, pp. 345–347 and 629–636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (__Journal of Graph T

Improved bounds for the chromatic number
Improved bounds for the chromatic number of a graph
✍ S. Louis Hakimi; Edward Schmeichel πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 97 KB πŸ‘ 2 views

## Abstract After giving a new proof of a well‐known theorem of Dirac on critical graphs, we discuss the elegant upper bounds of Matula and Szekeres‐Wilf which follow from it. In order to improve these bounds, we consider the following fundamental coloring problem: given an edge‐cut (__V__~1~, __V_