EDGE-DISJOINT HAMILTON CYCLES IN REGULAR GRAPHS OF LARGE DEGREE

被引：0

作者：

JACKSON, B ^{[1
]}

机构：

[1] UNIV WATERLOO,WATERLOO N2L 3G1,ONTARIO,CANADA

来源：

JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES | 1979年 / 19卷 / FEB期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：13 / 16

页数：4

共 50 条

[21] Edge-disjoint Odd Cycles in 4-edge-connected Graphs
Kawarabayashi, Ken-ichi
Kobayashi, Yusuke
[J]. 29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 206 - 217
[22] A PARALLEL ALGORITHM FOR EDGE-COLORING OF GRAPHS WITH EDGE-DISJOINT CYCLES
ALBACEA, EA
[J]. INFORMATION PROCESSING LETTERS, 1992, 43 (06) : 309 - 314
[23] Optimal construction of edge-disjoint paths in random regular graphs
Frieze, AM
Zhao, L
[J]. COMBINATORICS PROBABILITY & COMPUTING, 2000, 9 (03) : 241 - 263
[24] EDGE-DISJOINT PATHS AND CYCLES IN N-EDGE-CONNECTED GRAPHS
HUCK, A
[J]. JOURNAL OF GRAPH THEORY, 1992, 16 (06) : 571 - 589
[25] Optimal construction of edge-disjoint paths in random regular graphs
Frieze, AM
Zhao, L
[J]. PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 346 - 355
[26] Edge-disjoint odd cycles in graphs with small chromatic number
Berge, C
Reed, B
[J]. ANNALES DE L INSTITUT FOURIER, 1999, 49 (03) : 783 - +
[27] The minimal Kirchhoff index of graphs with k edge-disjoint cycles
Jiang, Xiaoyan
Dai, Huawei
[J]. ARS COMBINATORIA, 2014, 115 : 293 - 304
[28] Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k
Bollobas, B.
Cooper, C.
Fenner, T.I.
Frieze, A.M.
[J]. 2000, Wiley-Liss Inc. (34)
[29] Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k
Bollobás, B
Cooper, C
Fenner, TI
Frieze, AM
[J]. JOURNAL OF GRAPH THEORY, 2000, 34 (01) : 42 - 59
[30] EDGE-DISJOINT PACKINS OF GRAPHS
CORNEIL, DG
MASUYAMA, S
HAKIMI, SL
[J]. DISCRETE APPLIED MATHEMATICS, 1994, 50 (02) : 135 - 148

← 1 2 3 4 5 →