✦ LIBER ✦

Parsimonious polyhedra

✍ Scribed by Gray, Jeremy

Book ID: 109787701
Publisher: Nature Publishing Group
Year: 1994
Tongue: English
Weight: 329 KB
Volume: 367
Category: Article
ISSN: 0028-0836
DOI: 10.1038/367598a0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parsimonious trees

✍ A. D. Gordon 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 1020 KB

Parsimonious Asymptotics

✍ Ludwig, Donald 📂 Article 📅 1983 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 887 KB

Parsimonious Multigraphs

✍ Will, Todd G.; Hulett, Heather 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 98 KB

Parsimony

✍ N. L. Smirnova 📂 Article 📅 2001 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 103 KB

Parsimonious cluster systems

✍ François Brucker; Alain Gély 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 669 KB

Parsimonious edge coloring

✍ Michael O. Albertson; Ruth Haas 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 368 KB

In a graph G of maximum degree A, let y denote the largest fraction of edges that can be A-edge-colored. This paper investigates lower bounds for 7 together with infinite families of 13 graphs in which y is bounded away from 1. For instance, if G is cubic, then 7 >i ]7; and there \_<25 exists an inf