✦ LIBER ✦

Colorful e-products

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 113 KB
Volume: 32
Category: Article
ISSN: 0045-2068
DOI: 10.1016/s0045-2068(03)00140-8

No coin nor oath required. For personal study only.

✦ Synopsis

We are pleased to inform you about an important development for the benefit of authors and readers of the Bioorganic Chemistry.

Bioorganic Chemistry is included in a new ''colorful e-products'' initiative from Elsevier, which permits the publication of color online at no charge to authors.

The colorful e-products solution provides a welcome step forward now that scientists increasingly access information online. Authors in many disciplines need to be able to publish their work in color, but the cost of color printing can be prohibitive. Elsevier has therefore initiated this new program enabling authors to take advantage of free online color publication in their Bioorganic Chemistry articles.

📜 SIMILAR VOLUMES

Colorful

✍ Eto Mori 📂 Fiction 📅 2021 🏛 Catapult 🌐 English ⚖ 144 KB 👁 1 views

****A beloved and bestselling classic in Japan, this groundbreaking tale of a dead soul who gets a second chance is now available in English for the very first time.**** "Congratulations, you've won the lottery!" shouts the angel Prapura to a formless soul. The soul hasn't been kicked out of the c

Colorful Strips

✍ Greg Aloupis; Jean Cardinal; Sébastien Collette; Shinji Imahori; Matias Korman; 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 215 KB

Colorful Calcium Sensors

✍ Laurens Lindenburg; Dr. Maarten Merkx 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 468 KB

Colorful induced subgraphs

✍ H.A. Kierstead; W.T. Trotter 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 302 KB

A colored graph is a graph whose vertices have been properly, though not necessarily optimally colored, with integers. Colored graphs have a natural orientation in which edges are directed from the end point with smaller color to the end point with larger color. A subgraph of a colored graph is colo

Very Colorful Theorems

✍ Jorge L. Arocha; Imre Bárány; Javier Bracho; Ruy Fabila; Luis Montejano 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 384 KB

Simple product colorings

✍ Peter D Johnson Jr. 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 131 KB

If A is a set colored with m colors, and B is colored with n colors, the coloring of A x B obtained by coloring (a, b) with the pair (color of a, color of b) will be called an m x n simple product coloring (SPC) of A x B. SPC's of Cartesian products of three or more sets are defined analogously. It