✦ LIBER ✦

Embedding edge-colorings into 2-edge-connected k-factorizations of kkn+1

✍ Scribed by C. A. Rodger; E. B. Wantland

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 812 KB
Volume: 19
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190190205

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this paper we use the Hilton method of amalgamations to give a different proof of a theorem of Nash‐Williams that finds necessary and sufficient conditions for the embedding of an edge‐colored K~v~ into an edge‐colored K~v~ in which the edges of each color induce a 2‐edge‐connected k‐factor. © 1995 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

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.