Bounds for minimum feedback vertex sets in distance graphs and circulant graphs

被引：0
|
作者：
LIESP, Université Claude Bernard LyonI, 843, Bd. Du 11 Novembre 1918, 69622 Villeurbanne Cedex, France [1 ]
不详 [2 ]
机构：
来源：
Discrete Math. Theor. Comput. Sci. | 2008年 / 1卷 / 57-70期
关键词：
Graphic methods;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] The minimum feedback vertex set for kronecker product of graphs
    Tigrine, Fouad
    Kheddouci, Hamamache
    UTILITAS MATHEMATICA, 2007, 74 : 207 - 237
  • [22] FEEDBACK VERTEX SETS AND CYCLICALLY REDUCIBLE GRAPHS.
    Wang, Ching-Chy
    Lloyd, Errol L.
    Soffa, Mary Lou
    Journal of the ACM, 1985, 32 (02): : 296 - 313
  • [23] Super Vertex Magic Circulant Graphs
    不详
    UTILITAS MATHEMATICA, 2019, 110 : 315 - 326
  • [24] Circular convex bipartite graphs: Feedback vertex sets
    Liu, Tian
    Lu, Min
    Lu, Zhao
    Xu, Ke
    THEORETICAL COMPUTER SCIENCE, 2014, 556 : 55 - 62
  • [25] Tractable Feedback Vertex Sets in Restricted Bipartite Graphs
    Jiang, Wei
    Liu, Tian
    Xu, Ke
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, 2011, 6831 : 424 - +
  • [26] A new bound on the feedback vertex sets in cubic graphs
    Liu, JP
    Zhao, C
    DISCRETE MATHEMATICS, 1996, 148 (1-3) : 119 - 131
  • [27] Independent feedback vertex sets for graphs of bounded diameter
    Bonamy, Marthe
    Dabrowski, Konrad K.
    Feghali, Carl
    Johnson, Matthew
    Paulusma, Daniel
    INFORMATION PROCESSING LETTERS, 2018, 131 : 26 - 32
  • [28] Distance magic circulant graphs
    Cichacz, Sylwia
    Froncek, Dalibor
    DISCRETE MATHEMATICS, 2016, 339 (01) : 84 - 94
  • [29] Graphs with unique minimum edge-vertex dominating sets
    Senthilkumar, B.
    Chellali, M.
    Kumar, H. Naresh
    Venkatakrishnan, Y. B.
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2025, 10 (01) : 99 - 109
  • [30] Graphs with unique minimum vertex-edge dominating sets
    Senthilkumar, B.
    Chellali, M.
    Naresh Kumar, H.
    Venkatakrishnan, Yanamandram B.
    RAIRO-OPERATIONS RESEARCH, 2023, 57 (04) : 1785 - 1795
12345