✦ LIBER ✦

The Contact Number of an Affine Immersion and Its Upper Bounds

✍ Scribed by Kouhei Miura

Publisher: Springer
Year: 2009
Tongue: English
Weight: 491 KB
Volume: 56
Category: Article
ISSN: 1422-6383
DOI: 10.1007/s00025-009-0444-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound on the Ramsey number of t

An upper bound on the Ramsey number of trees

✍ András Gyárfás; Zsolt Tuza 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 66 KB

An upper bound for the average number of

An upper bound for the average number of regions

✍ Saul Stahl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 190 KB

An upper bound on the number of planarK-

An upper bound on the number of planarK-sets

✍ János Pach; William Steiger; Endre Szemerédi 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 746 KB

An upper bound for the path number of a

An upper bound for the path number of a graph

✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe

An upper bound on the path number of a d

An upper bound on the path number of a digraph

✍ Richard C O'Brien 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 431 KB

An Upper Bound for the Clar Number of Fu

An Upper Bound for the Clar Number of Fullerene Graphs

✍ Heping Zhang; Dong Ye 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 337 KB