Edge-disjoint Hamilton cycles in graphs

被引：0
|
作者：
机构：
来源：
| 1600年 / Publ by New York Acad of Sciences, New York, NY, USA卷 / 576期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Edge-disjoint Hamiltonian cycles in hypertournaments
    Petrovic, V
    Thomassen, C
    JOURNAL OF GRAPH THEORY, 2006, 51 (01) : 49 - 52
  • [32] Edge-disjoint packing of stars and cycles
    Jiang, Minghui
    Xia, Ge
    Zhang, Yong
    THEORETICAL COMPUTER SCIENCE, 2016, 640 : 61 - 69
  • [33] Edge-Disjoint Branchings in Temporal Graphs
    Campos, Victor
    Lopes, Raul
    Marino, Andrea
    Silva, Ana
    COMBINATORIAL ALGORITHMS, IWOCA 2020, 2020, 12126 : 112 - 125
  • [34] Edge-disjoint paths in planar graphs
    Chekuri, C
    Khanna, S
    Shepherd, FB
    45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 71 - 80
  • [35] Edge-disjoint maximal planar graphs
    Discrete Math, 1-3 (235-241):
  • [36] SHORTEST EDGE-DISJOINT PATHS IN GRAPHS
    SCHWILL, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 505 - 516
  • [37] Edge-Disjoint Packing of Stars and Cycles
    Jiang, Minghui
    Xia, Ge
    Zhang, Yong
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 676 - 687
  • [38] Edge-disjoint paths in expander graphs
    Frieze, AM
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 717 - 725
  • [39] EDGE-DISJOINT PATHS IN PLANAR GRAPHS
    FRANK, A
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 39 (02) : 164 - 178
  • [40] Edge-disjoint paths in expander graphs
    Frieze, AM
    SIAM JOURNAL ON COMPUTING, 2001, 30 (06) : 1790 - 1801
12345