𝔖 Bobbio Scriptorium
✦   LIBER   ✦

One ordering problem

✍ Scribed by Kh. G. Gamzatov; A. I. Saksonov


Publisher
Springer US
Year
1981
Tongue
English
Weight
952 KB
Volume
16
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Ordering problems
✍ V. V. Shkurba πŸ“‚ Article πŸ“… 1969 πŸ› Springer US 🌐 English βš– 359 KB
On a problem concerning ordered colourin
✍ Louis Caccetta; Rui Zhong Jia πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 192 KB

Let G be a connected graph with v(G)>~2 vertices and independence number ~(G). G is critical if for any edge e of G: (i) ~(G -e) > ct(G), if e is not a cut edge of G, and , 2, ife is a cut edge and Gi, G2 are the two components of G-e.

A problem on well ordered sets
✍ P. ErdΕ‘s; A. Hajnal; E. C. Milner πŸ“‚ Article πŸ“… 1969 πŸ› Akadmiai Kiad 🌐 English βš– 283 KB
One additive problem
✍ B. V. Levin; N. M. Timofeev πŸ“‚ Article πŸ“… 1989 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 384 KB
One extremal problem
✍ V. N. Malozemov πŸ“‚ Article πŸ“… 1973 πŸ› Springer US 🌐 English βš– 232 KB