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 条
  • [31] Distance approximation in bounded-degree and general sparse graphs
    Marko, Sharon
    Ron, Dana
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 475 - 486
  • [32] TESTING HEREDITARY PROPERTIES OF NONEXPANDING BOUNDED-DEGREE GRAPHS
    Czumaj, Artur
    Shapira, Asaf
    Sohler, Christian
    SIAM JOURNAL ON COMPUTING, 2009, 38 (06) : 2499 - 2510
  • [33] Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
    Boettcher, Julia
    Pruessmann, Klaas P.
    Taraz, Anusch
    Wuerfl, Andreas
    EUROPEAN JOURNAL OF COMBINATORICS, 2010, 31 (05) : 1217 - 1227
  • [34] On locating cubic subgraphs in bounded-degree connected bipartite graphs
    Stewart, IA
    DISCRETE MATHEMATICS, 1997, 163 (1-3) : 319 - 324
  • [35] Approximating the Distance to Properties in Bounded-Degree and General Sparse Graphs
    Marko, Sharon
    Ron, Dana
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (02)
  • [36] On Testability of First-Order Properties in Bounded-Degree Graphs
    Adler, Isolde
    Kohler, Noleen
    Peng, Pan
    PROCEEDINGS OF THE 2021 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2021, : 1578 - 1597
  • [37] Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs
    Corsten, Jan
    Mendonca, Walner
    COMBINATORICA, 2024, 44 (02) : 311 - 335
  • [38] Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs
    Jan Corsten
    Walner Mendonça
    Combinatorica, 2024, 44 : 311 - 335
  • [39] Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws
    Abrishami, Tara
    Chudnovsky, Maria
    Dibek, Cemil
    Rzazewski, Pawel
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 1448 - 1470
  • [40] TILING EDGE-COLOURED GRAPHS WITH FEW MONOCHROMATIC BOUNDED-DEGREE GRAPHS
    Corsten, J.
    Mendonca, W.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 561 - 566
12345