✦ LIBER ✦

An upper bound for the number of planar lattice triangulations

✍ Scribed by Emile E. Anclin

Book ID: 108396267
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 121 KB
Volume: 103
Category: Article
ISSN: 0097-3165
DOI: 10.1016/s0097-3165(03)00097-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the number of matroid

An upper bound for the number of matroids

✍ M.J Piff 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 199 KB

An upper bound for the total chromatic n

An upper bound for the total chromatic number

✍ H. R. Hind 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 379 KB

An Upper Bound for the Independent Domin

An Upper Bound for the Independent Domination Number

✍ Liang Sun; Jianfang Wang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 87 KB

Let G be a simple graph of order n and minimum degree $. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. In this paper, we show that i(G) n+2$&2 -n$. Thus a conjecture of Favaron is settled in the affirmative.

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 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

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