✦ LIBER ✦

Spanning -ended trees of bipartite graphs

✍ Scribed by Kano, Mikio; Matsuda, Haruhide; Tsugaki, Masao; Yan, Guiying

Book ID: 121321973
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 363 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.09.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reconstructing some bipartite graphs fro

Reconstructing some bipartite graphs from their spanning trees

✍ R.D Boyle 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Maximum matchings in bipartite graphs vi

Maximum matchings in bipartite graphs via strong spanning trees

✍ M. L. Balinski; J. Gonzalez 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB

Spanning trees of dual graphs

✍ Norman Biggs 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Spanning trees of extended graphs

✍ A. K. Kelmans 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 364 KB

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

Constructing trees in bipartite graphs

✍ U. Schulte 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 227 KB

In this paper we shall show that if G = (V,E) is a bipartite graph with more than (a -1)j YJ + (b -1)1X1 -(a -l)(b -1) edges, where (X, Y) is a vertex-partition for G and a < b are natural numbers with a < 1x1, b < 1 YI, then G contains every tree T with bipartitenumbers a < b. This result is relate