A NOTE ON THE COMPLEXITY OF FINDING REGULAR SUBGRAPHS

被引：10
|
作者：
PLESNIK, J
机构：
来源：
DISCRETE MATHEMATICS | 1984年 / 49卷 / 02期
关键词：
D O I：
10.1016/0012-365X(84)90113-4
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：161 / 167
页数：7
相关论文
共 50 条
  • [1] Parameterized complexity of finding regular induced subgraphs
    Moser, Hannes
    Thilikos, Dimitrios M.
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (02) : 181 - 190
  • [2] Complexity of finding maximum regular induced subgraphs with prescribed degree
    Asahiro, Yuichi
    Eto, Hiroshi
    Ito, Takehiro
    Miyano, Eiji
    [J]. THEORETICAL COMPUTER SCIENCE, 2014, 550 : 21 - 35
  • [3] Note on regular subgraphs
    Rodl, V
    Wysocka, B
    [J]. JOURNAL OF GRAPH THEORY, 1997, 24 (02) : 139 - 154
  • [4] Complexity of finding dense subgraphs
    Asahiro, Y
    Hassin, R
    Iwama, K
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 121 (1-3) : 15 - 26
  • [5] Parameterized complexity of finding subgraphs with hereditary properties
    Khot, S
    Raman, V
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 137 - 147
  • [6] Parameterized complexity of finding connected induced subgraphs
    Cai, Leizhen
    Ye, Junjie
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 607 : 49 - 59
  • [7] Parameterized complexity of finding subgraphs with hereditary properties
    Khot, S
    Raman, V
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 289 (02) : 997 - 1008
  • [8] Finding regular subgraphs in both arbitrary and planar graphs
    Stewart, IA
    [J]. DISCRETE APPLIED MATHEMATICS, 1996, 68 (03) : 223 - 235
  • [9] The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation
    Enright, Jessica
    Lee, Duncan
    Meeks, Kitty
    Pettersson, William
    Sylvester, John
    [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 152 - 166
  • [10] Parameterized complexity of finding small degree-constrained subgraphs
    Amini, Omid
    Sau, Ignasi
    Saurabh, Saket
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2012, 10 : 70 - 83
12345