✦ LIBER ✦

Bounds on the convex label number of trees

✍ Scribed by Marshall Bern; Alice Wong; Maria Klawe

Book ID: 110564346
Publisher: Springer-Verlag
Year: 1987
Tongue: English
Weight: 650 KB
Volume: 7
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02579299

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the number of disjoint spannin

Bounds on the number of disjoint spanning trees

✍ Sukhamay Kundu 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Convex labelings of trees

✍ Stephen J. Dow; Douglas F. Rall; Peter J. Slater 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB

A convex labeling of a tree T o f order n is a one-to-one function f from the vertex set of Tinto the nonnegative integers, so that f ( y ) 5 ( f ( x ) t f(z))/2 for every path x, y, z of length 2 in T. If, in addition, f (v) I n -1 for every vertex v of T, then f is a perfect convex labeling and T

Bounds of the number of leaves of spanni

Bounds of the number of leaves of spanning trees

✍ A. V. Bankevich, D. V. Karpov 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 326 KB

Asymptotic bounds for the number of conv

Asymptotic bounds for the number of convex n-ominoes

✍ David A. Klarner; Ronald L. Rivest 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 819 KB

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

The achromatic number of bounded degree

The achromatic number of bounded degree trees

✍ Niall Cairnie; Keith Edwards 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 621 KB

The achromatic number ~b(G) of a simple graph G is the largest number of colours possible in a proper vertex colouring of G in which each pair of coiours appears on at least one edge. The problem of determining the achromatic number of a tree is known to be NP-hard (Cairnie and Edwards, 1997). In t