✦ LIBER ✦

Spanning trees and a conjecture of Kontsevich

✍ Scribed by Richard P. Stanley

Publisher: Springer
Year: 1998
Tongue: English
Weight: 730 KB
Volume: 2
Category: Article
ISSN: 0218-0006
DOI: 10.1007/bf01608530

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a conjecture concerning spanning tree

On a conjecture concerning spanning tree invariants and loop systems

✍ R.B. Bapat 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 114 KB

Spanning trees of extended graphs

✍ A. K. Kelmans 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 364 KB

Unranking and ranking spanning trees of

Unranking and ranking spanning trees of a graph

✍ Charles J Colbourn; Robert P.J Day; Louis D Nel 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 845 KB

Minimum Spanning Trees and Types of Diss

Minimum Spanning Trees and Types of Dissimilarities

✍ Bruno Leclerc 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 295 KB

Computing capacitated minimal spanning t

Computing capacitated minimal spanning trees efficiently

✍ A. Kershenbaum 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 645 KB

The number of spanning trees of a graph

✍ Jianxi Li; Wai Chee Shiu; An Chang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 387 KB

In this paper, we present some sharp upper bounds for the number of spanning trees of a connected graph in terms of its structural parameters such as the number of vertices, the number of edges, maximum vertex degree, minimum vertex degree, connectivity and chromatic number.