✦ LIBER ✦

Solutions of a problem of Ore on spanning trees and its generalization

✍ Scribed by G.B. Mund; S.B. Rao; C.K. Mohapatra

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 232 KB
Volume: 15
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00556-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting spanning trees in the graphs of

Counting spanning trees in the graphs of Kleitman and Golden and a generalization

✍ R. Vohra; L. Washington 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 302 KB

A new calculation is given for the number of spanning trees in a family of labellec; graphs considered by Kleitman and Golden, and for a more general class of such graphs.

On the value of a random minimum spannin

On the value of a random minimum spanning tree problem

✍ A.M. Frieze 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 324 KB

A comparative analysis of several formul

A comparative analysis of several formulations for the generalized minimum spanning tree problem

✍ Corinne Feremans; Martine Labbé; Gilbert Laporte 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 423 KB 👁 1 views

Transformations of a Graph Increasing it

Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees

✍ A.K. Kelmans 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 310 KB

On a problem of Zalcman and its generali

On a problem of Zalcman and its generalizations

✍ V. V. Volchkov 📂 Article 📅 1993 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 288 KB

A short note on the approximability of t

A short note on the approximability of the maximum leaves spanning tree problem

✍ G. Galbiati; F. Maffioli; A. Morzenti 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 354 KB