✦ LIBER ✦

The genus of nearly complete graphs-case 6

✍ Scribed by Jonathan L. Gross

Publisher: Springer
Year: 1975
Tongue: English
Weight: 250 KB
Volume: 13
Category: Article
ISSN: 0001-9054
DOI: 10.1007/bf01836527

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The genus of nearly complete graphs-case

The genus of nearly complete graphs-case 6

✍ Jonathan L. Gross 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 48 KB

Nonorientable genus of nearly complete b

Nonorientable genus of nearly complete bipartite graphs

✍ Bojan Mohar 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 524 KB

The graph genus problem is NP-complete

✍ Carsten Thomassen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 471 KB

The total chromatic number of nearly com

The total chromatic number of nearly complete bipartite graphs

✍ A.J.W Hilton 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 753 KB

Orientable and nonorientable genus of th

Orientable and nonorientable genus of the complete bipartite graph

✍ André Bouchet 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 417 KB

On ramsey numbers of forests versus near

On ramsey numbers of forests versus nearly complete graphs

✍ Gary Chartrand; Ronald J. Gould; Albert D. Polimeni 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 1 views

## Abstract A formula is presented for the ramsey number of any forest of order at least 3 versus any graph __G__ of order __n__ ≥ 4 having clique number __n__ ‐ 1. In particular, if __T__ is a tree of order __m__ ≥ 3, then __r(T, G)__ = 1 + (__m__ ‐ 1)(__n__ ‐ 2).