✦ LIBER ✦

A Note on the Enumeration and Listing of All Possible Trees in a Connected Linear Graph

✍ Scribed by Horace M. Trent

Book ID: 123670766
Publisher: National Academy of Sciences
Year: 1954
Tongue: English
Weight: 188 KB
Volume: 40
Category: Article
ISSN: 0027-8424
DOI: 10.2307/89367

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Simple Algorithm for Listing All the T

A Simple Algorithm for Listing All the Trees of a Graph

✍ Minty, G. 📂 Article 📅 1965 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 157 KB

On the use of Petri nets for the enumera

On the use of Petri nets for the enumeration of all trees in a graph

✍ G.S. Hura 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 218 KB

An improved method of enumerating all tr

An improved method of enumerating all trees and minimal paths in a graph using Petri nets

✍ J.M. Kontoleon; D. Mandaltsis 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 276 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 955 || Faster enumeration of all spanning trees of a directed graph

✍ Akl, Selim G.; Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 715 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1178 || An algorithm for enumerating all directed spanning trees in a directed graph

✍ Asano, Tetsuo; Igarashi, Yoshihide; Nagamochi, Hiroshi; Miyano, Satoru; Suri, Su 📂 Article 📅 1996 🏛 Springer Berlin Heidelberg ⚖ 418 KB

On the largest tree of given maximum deg

On the largest tree of given maximum degree in a connected graph

✍ Y. Caro; I. Krasikov; Y. Roditty 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 1 views

## Abstract We prove that every connected graph __G__ contains a tree __T__ of maximum degree at most __k__ that either spans __G__ or has order at least __k__δ(__G__) + 1, where δ(__G__) is the minimum degree of __G.__ This generalizes and unifies earlier results of Bermond [1] and Win [7]. We als