✦ LIBER ✦

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

✍ Scribed by Haruko Okamura

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 424 KB
Volume: 111
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90177-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paths in k-edge-connected graphs

✍ Haruko Okamura 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 562 KB

The maximal size of graphs with at most

The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices

✍ Mao-cheng Cai 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 502 KB

Let n and k be positive integers satisfying k + 1 s n s 3k -1, and G a simple graph of order n and size e(G) with at most k edge-disjoint paths connecting any two adjacent vertices. In this paper we prove that e(G) s l(n + k)\*/8], and give complete characterizations of the extremal graphs and the e

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.