✦ 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
DOI: 10.1007/bf01078261

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

On a problem concerning ordered colourings

✍ 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

On a problem in scheduling theory (2 x m

On a problem in scheduling theory (2 x m ordering problem)

✍ V. E. Khenkin 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 429 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