COVERING VERTICES OF A GRAPH BY VERTEX-DISJOINT PATHS

被引：13
|
作者：
NOORVASH, S [1 ]
机构：
[1] UNIV ARIZONA,TUCSON,AZ 85721
来源：
PACIFIC JOURNAL OF MATHEMATICS | 1975年 / 58卷 / 01期
关键词：
D O I：
10.2140/pjm.1975.58.159
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：159 / 168
页数：10
相关论文
共 50 条
  • [41] On vertex-disjoint complete bipartite subgraphs in a bipartite graph
    Wang, H
    GRAPHS AND COMBINATORICS, 1999, 15 (03) : 353 - 364
  • [42] VERTEX-DISJOINT PATHS AND EDGE-DISJOINT BRANCHINGS IN DIRECTED-GRAPHS
    WHITTY, RW
    JOURNAL OF GRAPH THEORY, 1987, 11 (03) : 349 - 358
  • [43] On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
    Araujo, Julio
    Campos, Victor A.
    Maia, Ana Karolinna
    Sau, Ignasi
    Silva, Ana
    LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 66 - 79
  • [44] Computing Vertex-Disjoint Paths in Large Graphs Using MAOs
    Johanna E. Preißer
    Jens M. Schmidt
    Algorithmica, 2020, 82 : 146 - 162
  • [45] Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey
    Chiba, Shuya
    Yamashita, Tomoki
    GRAPHS AND COMBINATORICS, 2018, 34 (01) : 1 - 83
  • [46] Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey
    Shuya Chiba
    Tomoki Yamashita
    Graphs and Combinatorics, 2018, 34 : 1 - 83
  • [47] Constructing vertex-disjoint paths in (n,k)-star graphs
    Lin, Tsung-Chi
    Duh, Dyi-Rong
    INFORMATION SCIENCES, 2008, 178 (03) : 788 - 801
  • [48] On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths
    Araujo, Julio
    Campos, Victor A.
    Maia, Ana Karolinna
    Sau, Ignasi
    Silva, Ana
    ALGORITHMICA, 2020, 82 (06) : 1616 - 1639
  • [49] Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths
    Dai, Guowei
    Guo, Longkun
    Gutin, Gregory
    Zhang, Xiaoyan
    Zhang, Zan-Bo
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (06) : 3870 - 3878
  • [50] Vertex-disjoint short cycles containing specified edges in a graph
    Matsumura, Hajime
    ARS COMBINATORIA, 2006, 80 : 147 - 152
12345