COVERING THE EDGES OF A GRAPH BY CIRCUITS

被引：0
|
作者：
KESELMAN, DY
机构：
来源：
CYBERNETICS | 1987年 / 23卷 / 03期
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：306 / 313
页数：8
相关论文
共 50 条
  • [1] Covering the edges of a graph with triangles
    Bujtas, Csilla
    Davoodi, Akbar
    Ding, Laihao
    Gyori, Ervin
    Tuza, Zsolt
    Yang, Donglei
    [J]. DISCRETE MATHEMATICS, 2025, 348 (01)
  • [2] A note on covering the edges of a graph with bonds
    Neumann-Lara, V
    Rivera-Campo, E
    Urrutia, J
    [J]. DISCRETE MATHEMATICS, 1999, 197 (1-3) : 633 - 636
  • [3] Covering the edges of a connected graph by paths
    Pyber, L
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1996, 66 (01) : 152 - 159
  • [4] COVERING THE EDGES OF A RANDOM GRAPH BY CLIQUES
    FRIEZE, A
    REED, B
    [J]. COMBINATORICA, 1995, 15 (04) : 489 - 497
  • [5] Covering the edges of a graph by three odd subgraphs
    Matrai, Tamas
    [J]. JOURNAL OF GRAPH THEORY, 2006, 53 (01) : 75 - 82
  • [6] Clique covering the edges of a locally cobipartite graph
    Chen, GT
    Jacobson, MS
    Kézdy, AE
    Lehel, J
    Scheinerman, ER
    Wang, C
    [J]. DISCRETE MATHEMATICS, 2000, 219 (1-3) : 17 - 26
  • [7] THE MINIMUM NUMBER OF TRIANGLES COVERING THE EDGES OF A GRAPH
    LEHEL, J
    [J]. JOURNAL OF GRAPH THEORY, 1989, 13 (03) : 369 - 384
  • [8] Covering the Edges of a Complete Geometric Graph with Convex Polygons
    Pinchasi, Rom
    Yerushalmi, Oren
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2023,
  • [9] Covering a graph with cycles passing through given edges
    Wang, H
    [J]. JOURNAL OF GRAPH THEORY, 1997, 26 (02) : 105 - 109
  • [10] Covering the edges of a graph by a prescribed tree with minimum overlap
    Alon, N
    Caro, Y
    Yuster, R
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 71 (02) : 144 - 161
12345