Embedding edge‐colorings into 2‐edge‐connected <i>k</i>‐factorizations of <i>k<sub>kn+1</sub></i>

C. A. Rodger, Evan B. Wantland

Journal of Graph Theory · 1995 · 27 citations · 15 references

Concepts

Abstract

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 &amp; Sons, Inc.

References

15