✦ LIBER ✦

Independent trees in graphs

✍ Scribed by Andreas Huck

Book ID: 105116030
Publisher: Springer Japan
Year: 1994
Tongue: English
Weight: 943 KB
Volume: 10
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01202468

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Independent Spanning Trees on Od

Optimal Independent Spanning Trees on Odd Graphs

✍ Jong-Seok Kim; Hyeong-Ok Lee; Eddie Cheng; László Lipták 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 749 KB

Double independence and tree pairs in gr

Double independence and tree pairs in graphs

✍ Novak, Ladislav A.; Gibbons, Alan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 671 KB

Independence polynomials of k-tree relat

Independence polynomials of k-tree related graphs

✍ Lanzhen Song; William Staton; Bing Wei 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 292 KB

On the independent spanning trees of rec

On the independent spanning trees of recursive circulant graphs with

✍ Jinn-Shyong Yang; Jou-Ming Chang; Shyue-Ming Tang; Yue-Li Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 895 KB

Trees in random graphs

✍ P. Erdös; Z. Palka 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Generation of all possible trees of a gr

Generation of all possible trees of a graph in independent groups

✍ R. Hashemian; M.S. Bakhtiar 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 268 KB

A special graph, the PS graph, is introduced and an algorithm is developed to generate all trees of such graphs. It is proved that for any given graph, G there exists certain number of PS graphs, obtained from G, such that the collection of all trees of all such PS graph span all trees of G with no