𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Martin's axiom and spanning trees of infinite graphs

✍ Scribed by Péter Komjáth

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
287 KB
Volume
56
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with homeomorphically irreducible
Graphs with homeomorphically irreducible spanning trees
✍ Michael O. Albertson; David M. Berman; Joan P. Hutchinson; Carsten Thomassen 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 509 KB

## Abstract It is an NP‐complete problem to decide whether a graph contains a spanning tree with no vertex of degree 2. We show that these homeomorphically irreducible spanning trees are contained in all graphs with minimum degree at least __c__√__n__ and in triangulations of the plane. They are ne

Spanning paths in infinite planar graphs
Spanning paths in infinite planar graphs
✍ Dean, Nathaniel; Thomas, Robin; Yu, Xingxing 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 796 KB

Let G be a 4connected infinite planar graph such that the deletion of any finite set of vertices of G results in at most one infinite component. We prove a conjecture of Nash-Williams that G has a 1 -way infinite spanning path. 0 1996 John Wiley & Sons, Inc. [7] has shown that every 4-connected fini

End-faithful spanning trees inT1-free gr
End-faithful spanning trees inT1-free graphs
✍ Polat, Norbert 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

We prove that any connected graph that contains no subdivision of an ℵ 1regular tree has an end-faithful spanning tree; and furthermore that it has a rayless spanning tree if all its ends are dominated. This improves a result of Seymour and Thomas (An end-faithful spanning tree counterexample, Discr