✦ LIBER ✦

A short proof of Nash-Williams' theorem for the arboricity of a graph

✍ Scribed by Boliong Chen; Makoto Matsumoto; Jianfang Wang; Zhongfu Zhang; Jianxun Zhang

Publisher: Springer Japan
Year: 1994
Tongue: English
Weight: 85 KB
Volume: 10
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01202467

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A short proof of a theorem about the cir

A short proof of a theorem about the circumference of a graph

✍ Tian Feng 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 125 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

On a generalization of a theorem of Nash

On a generalization of a theorem of Nash-Williams

✍ Bert Fassbender 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 173 KB

A short proof for the Faudree-Schelp the

A short proof for the Faudree-Schelp theorem on path-connected graphs

✍ Cai Xiao-Tao 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract In this note a shortened proof is given for the Faudree—Schelp theorem on path‐connected graphs.

A short proof of Gamas’s theorem

✍ Andrew Berget 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 95 KB

A short proof of Stone's theorem

✍ A. Abian 📂 Article 📅 1970 🏛 Akadmiai Kiad 🌐 English ⚖ 67 KB