𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two-coloring the faces of arrangements

✍ Scribed by B. Grünbaum

Publisher
Springer Netherlands
Year
1980
Tongue
English
Weight
232 KB
Volume
11
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-coloring inequalities for Euclidean
Two-coloring inequalities for Euclidean arrangements in general position
✍ George B. Purdy; John E. Wetzel 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 451 KB

G.J. Simmons proved in 1972 that if the regions formed by a Euclidean arrangement of lines in general position are two-colored, with r red regions and g green regions, then r G 2g -2 so that r/g c 2. We use a variant of Simmons' argument to find some analogous estimates in higher dimensional Euclide

Heterocyclohexaaromatic Compound with Fa
Heterocyclohexaaromatic Compound with Face-to-Face Arrangement of Two Benzene Rings
✍ Prof. Dr. Thomas Kauffmann; Dr. Herbert Lexy 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

despite the high temperature. Thus, according to diffractometer measurements the residue still has the crystallinity of the startingcellulose even after 50 % degradation. Nor do scanning electron photomicrographs show any serious changes in the structure at this stage of the degradation. Chitin (Fl

The face lattice of hyperplane arrangeme
The face lattice of hyperplane arrangements
✍ Günter M. Ziegler 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 699 KB

## Every arrangement %' of a&e hyperplanes in Rd determines a partition of Rd into open topological cells. The face lattice L(X) of this partition was the object of a smdy by Barnabei and Brini, wko de.;ermined the homotopy type of its intervals. We use g:am&ic con~huctions from the theory of conv

Simultaneous coloring of edges and faces
Simultaneous coloring of edges and faces of plane graphs
✍ Oleg V. Borodin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 888 KB

The edges and faces of a plane graph are colored so that every two adjacent or incident of them are colored differently. The minimal number of colors for this kind of coloring is estimated. For the plane graphs of the maximal degree at least 10, the bound is the best possible. The proof is based on