𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fan-type theorem for path-connectivity

✍ Scribed by Akira Saito

Publisher
Springer-Verlag
Year
1996
Tongue
English
Weight
219 KB
Volume
16
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fan-type theorem for path-connectivity
Fan-type theorem for path-connectivity
✍ Zhiquan Hu; Feng Tian; Bing Wei; Yoshimi Egawa; Kazuhide Hirohata 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

## Abstract For a connected noncomplete graph __G__, let μ(__G__):=min{max {__d__~__G__~(__u__), __d__~__G__~(v)}:__d__~__G__~(__u__, v)=2}. A well‐known theorem of Fan says that every 2‐connected noncomplete graph has a cycle of length at least min{|__V__(__G__)|, 2μ(__G__)}. In this paper, we pro

A Gallai–Edmonds-type structure theorem
A Gallai–Edmonds-type structure theorem for path-matchings
✍ Bianca Spille; László Szegő 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract As a generalization of matchings, Cunningham and Geelen introduced the notion of path‐matchings. We give a structure theorem for path‐matchings which generalizes the fundamental Gallai–Edmonds structure theorem for matchings. Our proof is purely combinatorial. © 2004 Wiley Periodicals,