EMBEDDING EDGE-COLORINGS INTO 2-EDGE-CONNECTED K-FACTORIZATIONS OF K-KN+1

被引：23
作者：
RODGER, CA
WANTLAND, EB
机构：
[1] Department of Discrete and Statistical Sciences, Auburn University, Auburn, Alabama
来源：
JOURNAL OF GRAPH THEORY | 1995年 / 19卷 / 02期
关键词：
D O I：
10.1002/jgt.3190190205
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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-n in which the edges of each color induce a 2-edge-connected k-factor. (C) 1995 John Wiley & Sons, Inc.
引用
收藏
页码：169 / 185
页数：17
相关论文
共 22 条
[11]   HAMILTONIAN DECOMPOSITIONS OF COMPLETE GRAPHS [J].
HILTON, AJW .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 36 (02) :125-134
[12]  
HILTON AJW, 1986, DISCRETE MATH, V48, P63
[13]   ON THE CONSTRUCTION OF ODD CYCLE SYSTEMS [J].
HOFFMAN, DG ;
LINDNER, CC ;
RODGER, CA .
JOURNAL OF GRAPH THEORY, 1989, 13 (04) :417-426
[14]  
LINDNER C, 1993, J COMBIN DIGEST, V1, P113
[15]   A PARTIAL M = (2K+1)-CYCLE SYSTEM OF ORDER-N CAN BE EMBEDDED IN AN M-CYCLE SYSTEM OF ORDER (2N+1)M [J].
LINDNER, CC ;
RODGER, CA .
DISCRETE MATHEMATICS, 1993, 117 (1-3) :151-159
[16]   NESTING OF CYCLE SYSTEMS OF ODD LENGTH [J].
LINDNER, CC ;
RODGER, CA ;
STINSON, DR .
DISCRETE MATHEMATICS, 1989, 77 (1-3) :191-203
[17]  
LINDNER CC, 1992, CONT DESIGN THEORY C
[18]   AMALGAMATIONS OF ALMOST REGULAR EDGE-COLORINGS OF SIMPLE GRAPHS [J].
NASHWILLIAMS, CSA .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1987, 43 (03) :322-342
[19]  
NASHWILLIAMS CSA, IN PRESS 10TH P BRIT
[20]  
NASHWILLIAMS CSA, IN PRESS J LONDON MA
123