✦ LIBER ✦

A simple way to tell a simple polytope from its graph

✍ Scribed by Gil Kalai

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 157 KB
Volume: 49
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(88)90064-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Simple Way to Some Sophisticated Fused

A Simple Way to Some Sophisticated Fused Nitrogen Heterocycles.

✍ Zbigniew Wrobel 📂 Article 📅 2005 🏛 John Wiley and Sons ⚖ 22 KB

## Abstract For Abstract see ChemInform Abstract in Full Text.

A simple way to introduce fibers into FE

A simple way to introduce fibers into FEM models

✍ Vanalli, L. ;Paccola, R. R. ;Coda, H. B. 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 457 KB

A simple way to visualize fibrinolysis i

A simple way to visualize fibrinolysis in the classroom

✍ Zeily Nurachman; Jatnika Hermawan; Yanti Rachmayanti; Lubna Baradja 📂 Article 📅 2003 🏛 The American Society for Biochemistry and Molecula 🌐 English ⚖ 178 KB

## Abstract Laboratory demonstration, as well as biochemistry lecture, has been used to complement explanation of biochemical processes. The laboratory demonstration is very useful in teaching biochemistry to students who lack background in biology. The experimental model of fibrinolysis described

A simple way to stabilize discrete syste

A simple way to stabilize discrete systems with jump markov parameters

✍ Engin Yaz 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 323 KB

A simple way to calculate the axis of an

A simple way to calculate the axis of an α-helix

✍ Johan Åqvist 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 214 KB

On simple MCD graphs containing a subgra

On simple MCD graphs containing a subgraph homeomorphic to K4

✍ Yongbing Shi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 807 KB

Let S. be the set of simple graphs on n vertices in which no two cycles have the same length. A graph G in S. is called a simple maximum cycle-distributed (MCD) graph if there exists no graph G' in S. with IE(G')j >IE(G)I. In this paper, we prove that there exists a simple MCD graph on n vertices su