Journal of Graph Theory · 1995 · 27 citations · 15 references
Natural SciencesMathematicsColor TheoryCombinatoricsTopologyGraph ColoringGraph TheoryMatroid TheoryColoring TheoremsEdge ColoringVertex Coloring
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.
15
Haim Hanani · Canadian Journal of Mathematics · 1960 · 336 citations · Full text
Embeddings of Steiner triple systems
Jean Doyen, Richard M. Wilson · Discrete Mathematics · 1973 · 154 citations
Decomposition of complete multigraphs into stars
Michael Tarsi · Discrete Mathematics · 1979 · 67 citations