Cycle packings in graphs and digraphs

被引：0
|
作者：
Quinn, J.J.
机构：
来源：
| 1996年 / 149期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
下载
收藏
页码：1 / 3
相关论文
共 50 条
  • [1] Cycle packings in graphs and digraphs
    Quinn, JJ
    DISCRETE MATHEMATICS, 1996, 149 (1-3) : 325 - 328
  • [2] Cycle extendability in graphs and digraphs
    Department of Mathematics and Statistics, Utah State University, Logan, UT 84322-3900, United States
    Linear Algebra Its Appl, 7 (1513-1519):
  • [3] Cycle extendability in graphs and digraphs
    Beasley, LeRoy B.
    Brown, David E.
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2011, 435 (07) : 1513 - 1519
  • [4] Decompositions and Packings of Digraphs with Orientations of a 4-Cycle
    Gardner, RB
    Huff, C
    Kennedy, J
    ARS COMBINATORIA, 2000, 54 : 269 - 282
  • [5] PACKINGS OF DIGRAPHS
    BENHOCINE, A
    VELDMAN, HJ
    WOJDA, AP
    ARS COMBINATORIA, 1986, 22 : 43 - 49
  • [6] On maximum cycle packings in polyhedral graphs
    Recht, Peter
    Stehling, Stefan
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2014, 2 (01) : 18 - 31
  • [7] Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
    Lo, Allan
    Patel, Viresh
    Yıldız, Mehmet Akif
    arXiv, 2023,
  • [8] 2p-cycle decompositions of some regular graphs and digraphs
    Ganesamurthy, S.
    Paulraja, P.
    DISCRETE MATHEMATICS, 2018, 341 (08) : 2197 - 2210
  • [9] An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs
    Xujin Chen
    Wenan Zang
    Algorithmica, 2006, 44 : 195 - 211
  • [10] An efficient algorithm for finding maximum cycle packings in reducible flow graphs
    Chen, XJ
    Zang, W
    ALGORITHMS AND COMPUTATION, 2004, 3341 : 306 - 317
12345