✦ LIBER ✦

Spanning Trees in Locally Planar Triangulations

✍ Scribed by M.N. Ellingham; Z.C. Gao

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 970 KB
Volume: 61
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spanning triangulations in graphs

✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 467 KB

## Abstract We prove that every graph of sufficiently large order __n__ and minimum degree at least 2__n__/3 contains a triangulation as a spanning subgraph. This is best possible: for all integers __n__, there are graphs of order __n__ and minimum degree ⌈2__n__/3⌉ − 1 without a spanning triangul

Trees in Triangulations

✍ C. Thomassen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 338 KB

Every triangulation of the orientable surface of genus \(g\) with no noncontractible cycle of length less than \(2^{3 \mathrm{p}+4}\) contains a spanning tree of maximum degree at most four. 1994 Academic Press, Inc

Ends in spanning trees

✍ Xingxing Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 97 KB

We refer to for terminology not specified here. Graphs mentioned in this note are undirected, simple. The following definition is due to Halin [l]: an end E of an infinite graph G is a set of l-way infinite paths in G such that P, Q E E iff for any finite subset R of V(G) there is a finite path in

Spanning trees in a cactus

✍ Y. Egawa; Preben Dahl Vestergaard 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Separator Based Sparsification: I. Plana

Separator Based Sparsification: I. Planarity Testing and Minimum Spanning Trees

✍ David Eppstein; Zvi Galil; Giuseppe F. Italiano; Thomas H. Spencer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 759 KB

We describe algorithms and data structures for maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We give a fully dynamic planarity testing algorithm that maintains a graph subject to edge insertions and deletio

Maximizing spanning trees in almost comp

Maximizing spanning trees in almost complete graphs

✍ Gilbert, Bryan; Myrvold, Wendy 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 2 views

We examine the family of graphs whose complements are a union of paths and cycles and develop a very simple algebraic technique for comparing the number of spanning trees. With our algebra, we can obtain a simple proof of a result of Kel'mans that evening out path lengths increases the number of spa