✦ LIBER ✦

The Link Component Number of Suspended Trees

✍ Scribed by Toshiki Endo

Book ID: 106047872
Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 216 KB
Volume: 26
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0936-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On plane graphs with link component numb

On plane graphs with link component number equal to the nullity

✍ Yuefeng Lin; S.D. Noble; Xian’an Jin; Wenfang Cheng 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 229 KB

The Number of Trees

✍ Richard Otter 📂 Article 📅 1948 🏛 John Hopkins University Press 🌐 English ⚖ 944 KB

The size-Ramsey number of trees

✍ P. E. Haxell; Y. Kohayakawa 📂 Article 📅 1995 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 638 KB

The Asymptotic Number of Leftist Trees

✍ M. Drmota 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 85 KB

The module of a 2-component link

✍ J. Levine 📂 Article 📅 1982 🏛 European Mathematical Society 🌐 English ⚖ 920 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