𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On extremal sizes of locallyk-tree graphs

✍ Scribed by Mieczysław Borowiecki; Piotr Borowiecki; Elżbieta Sidorowicz; Zdzisław Skupień

Book ID
111707667
Publisher
Springer
Year
2010
Tongue
English
Weight
250 KB
Volume
60
Category
Article
ISSN
0011-4642

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs which contain each tree of giv
On graphs which contain each tree of given size
✍ Jean-François Saclé; Mariusz Woźniak 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 393 KB

graph with girth no less than 2t + 1 and minimum degree no less than k/t and d(T), then G contains each tree T of size k. It is known that this conjecture holds for t = 1 and t = 2. We prove it in the case t = 3.

On tree-partitions of graphs
On tree-partitions of graphs
✍ Guoli Ding; Bogdan Oporowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A graph G admits a tree-partition of width k if its vertex set can be partitioned into sets of size at most k so that the graph obtained by identifying the vertices in each set of the partition, and then deleting loops and parallel edges, is a forest. In the paper, we characterize the classes of gra

On connectivities of tree graphs
On connectivities of tree graphs
✍ Guizhen Liu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB

Let T(G) be the tree graph of a graph G with cycle rank r. Then K ( T ( G ) ) 3 m ( G ) -r, where K(T(G)) and m(G) denote the connectivity of T ( G ) and the length of a minimum cycle basis for G, respectively. Moreover, the lower bound of m ( G ) -r is best possible.