✦ LIBER ✦

A short proof of a result of Pollak on Steiner minimal trees

✍ Scribed by D.Z Du; E.Y Yao; F.K Hwang

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 180 KB
Volume: 32
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(82)90056-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of full Steiner minimal trees

✍ F.K. Hwang; Jia Feng Weng; Ding Zhu Du 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 559 KB

Steiner minimal tree for a given set of points in the plane is a tree which interconnects these points using Eines of shortest possible total length. We construct an infinite class of trees which are the unique full Steiner minimal trees for their sets of endpoints (vertices of degree one).

A short proof of a martingale representa

A short proof of a martingale representation result

✍ Robert J. Elliott; Michael Kohlmann 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 113 KB

A Short Proof of a Result of Foata and Z

A Short Proof of a Result of Foata and Zeilberger

✍ R.J. Clarke 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 63 KB

Applying a result of Frankl and Rödl to

Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube

✍ Zevi Miller; Dan Pritikin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 820 KB

A new proof of Korzhik's result on burst

A new proof of Korzhik's result on burst distributions

✍ Siri Krishan Wasan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 155 KB

A short proof of a theorem on Hamiltonia

A short proof of a theorem on Hamiltonian graphs

✍ Ainouche, A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John