Subgraph-avoiding minimum decycling sets and k-conversion sets in graphs

被引:0
|
作者
Francis, M. D. [1 ]
Mynhardt, C. M. [2 ]
Wodlinger, J. L. [3 ]
机构
[1] Penn State Univ, Dept Math, University Pk, PA 16802 USA
[2] Univ Victoria, Dept Math & Stat, POB 3045, Victoria, BC V8W 3P4, Canada
[3] Vancouver Isl Univ, Dept Math, 900 Fifth St, Nanaimo, BC V9R 5S5, Canada
来源
基金
加拿大自然科学与工程研究理事会;
关键词
FEEDBACK VERTEX SETS; INDUCED FORESTS; ARC;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A decycling set of a graph G is a set S of vertices such that G[V - S] is acyclic. In this paper we prove that every non- complete graph G of maximum degree r >= 3 has a minimum decycling set S such that G[S] does not contain an (r-2)- regular graph as a subgraph. This generalizes a result in [P.A. Catlin and H.-J. Lai, Discrete Math. 141(1) (1995), 37- 46]. We give several consequences of our main result, including new proofs of known results.
引用
收藏
页码:288 / 304
页数:17
相关论文
共 50 条
  • [1] Subgraph-Avoiding Coloring of Graphs
    Shen, Jia
    [J]. JOURNAL OF GRAPH THEORY, 2010, 63 (04) : 300 - 310
  • [3] Efficient minimizer orders for large values of k using minimum decycling sets
    Pellow, David
    Pu, Lianrong
    Ekim, Baris
    Kotlar, Lior
    Berger, Bonnie
    Shamir, Ron
    Orenstein, Yaron
    [J]. GENOME RESEARCH, 2023, 33 (07) : 1154 - 1161
  • [4] The k-conversion number of regular graphs
    Mynhardt, Christina M.
    Wodlinger, Jane L.
    [J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2020, 17 (03) : 955 - 965
  • [5] Decycling sets in certain cartesian product graphs with one factor complete
    Hartnell, B. L.
    Whitehead, C. A.
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2008, 40 : 305 - 315
  • [6] Sketching Methods with Small Window Guarantee Using Minimum Decycling Sets
    Marcais, Guillaume
    Deblasio, Dan
    Kingsford, Carl
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 2024, 31 (07) : 597 - 615
  • [7] MINIMUM DOMINATING SETS WITH MINIMUM STATUS IN GRAPHS
    Bhanumathi, M.
    Niroja, R.
    [J]. ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2022, 33 : 73 - 96
  • [8] Pattern avoiding permutations and independent sets in graphs
    Bean, Christian
    Tannock, Murray
    Ulfarsson, Henning
    [J]. JOURNAL OF COMBINATORICS, 2020, 11 (04) : 705 - 732
  • [9] On minimum secure dominating sets of graphs
    Burger, A. P.
    de Villiers, A. P.
    van Vuuren, J. H.
    [J]. QUAESTIONES MATHEMATICAE, 2016, 39 (02) : 189 - 202
  • [10] On Minimum Feedback Vertex Sets in Graphs
    Takaoka, Asahi
    Tayu, Satoshi
    Ueno, Shuichi
    [J]. 2012 THIRD INTERNATIONAL CONFERENCE ON NETWORKING AND COMPUTING (ICNC 2012), 2012, : 429 - 434