✦ LIBER ✦

2-Reducible Two Paths and an Edge Constructing a Path in (2k+ 1)-Edge-Connected Graphs

✍ Scribed by Haruko Okamura

Book ID: 106047868
Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 606 KB
Volume: 26
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0932-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paths containing two adjacent edges in (

Paths containing two adjacent edges in (2k+1)-edge-connected graphs

✍ Haruko Okamura 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Two Paths Joining Given Vertices in 2k-E

Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs

✍ Haruko Okamura 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 148 KB

The existence of a 2-factor in K1, n-fre

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity

✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.

Upon the removal of the edges of a 1-fac

Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph

✍ Philip Sinclair 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 206 KB