Bounded-degree independent sets in planar graphs

被引：2
|
作者：
Biedl, T [1 ]
Wilkinson, DF [1 ]
机构：
[1] Univ Waterloo, Sch Comp Sci, Waterloo, ON N2L 3G1, Canada
来源：
THEORY OF COMPUTING SYSTEMS | 2005年 / 38卷 / 03期
关键词：
D O I：
10.1007/s00224-005-1139-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
An independent set of a graph is a set of vertices without edges between them. Every planar graph has an independent set of size at least 1/4n and there are planar graphs for which any independent set has size at most 1/4n. In this paper similar bounds are provided for the problem of bounded-degree independent set, i.e., an independent set where additionally all vertices have degree less than a pre-specified bound D. Our upper and lower bounds match (up to a small constant) for D <= 16.
引用
收藏
页码：253 / 278
页数：26
相关论文
共 50 条
  • [21] On ordered Ramsey numbers of bounded-degree graphs
    Balko, Martin
    Jelinek, Vit
    Valtr, Pavel
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 134 : 179 - 202
  • [22] The complexity of approximating averages on bounded-degree graphs
    Galanis, Andreas
    Stefankovic, Daniel
    Vigoda, Eric
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 1345 - 1355
  • [23] Complexity analysis of P3-convexity problems on bounded-degree and planar graphs
    Penso, Lucia Draque
    Protti, Fabio
    Rautenbach, Dieter
    Souza, Ueverton dos Santos
    THEORETICAL COMPUTER SCIENCE, 2015, 607 : 83 - 95
  • [24] Hypocomb: Bounded-Degree Localized Geometric Planar Graphs for Wireless Ad Hoc Networks
    Li, Xu
    Mitton, Nathalie
    Simplot-Ryl, Isabelle
    Simplot-Ryl, David
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (07) : 1341 - 1354
  • [25] On induced-universal graphs for the class of bounded-degree graphs
    Esperet, Louis
    Labourel, Arnaud
    Ochem, Pascal
    INFORMATION PROCESSING LETTERS, 2008, 108 (05) : 255 - 260
  • [26] Computing bounded-degree phylogenetic roots of disconnected graphs
    Chen, ZZ
    Tsukiji, T
    GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 308 - 319
  • [27] Independent Sets near the Lower Bound in Bounded Degree Graphs
    Dvorak, Zdenek
    Lidicky, Bernard
    34TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2017), 2017, 66
  • [28] Computing bounded-degree phylogenetic roots of disconnected graphs
    Chen, Zhi-Zhong
    Tsukiji, Tatsuie
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2006, 59 (02): : 125 - 148
  • [29] BOUNDED-DEGREE SPANNING TREES IN RANDOMLY PERTURBED GRAPHS
    Krivelevich, Michael
    Kwan, Matthew
    Sudakov, Benny
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) : 155 - 171
  • [30] Colorful orthology clustering in bounded-degree similarity graphs
    Lopez Sanchez, Alitzel
    Lafond, Manuel
    JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2021, 19 (06)
12345