Connecting face hitting sets in planar graphs

被引：5
|
作者：
Schweitzer, Pascal [1 ]
Schweitzer, Patrick [2 ]
机构：
[1] Max Planck Inst Comp Sci, D-66123 Saarbrucken, Germany
[2] Univ Luxembourg, Interdisciplinary Ctr Secur Reliabil & Trust, L-1359 Luxembourg, Luxembourg
来源：
INFORMATION PROCESSING LETTERS | 2010年 / 111卷 / 01期
关键词：
Combinatorial problems; Planar graph; Face hitting set;
D O I：
10.1016/j.ipl.2010.10.008
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n - 6. Furthermore we show that this bound is tight by providing a lower bound in the form of a family of graphs. This improves the previously known upper and lower bound of 11n - 18 and 3n respectively by Grigoriev and Sitters. Our proof is valid for simple graphs with loops and generalizes to graphs embedded in surfaces of arbitrary genus. (c) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：11 / 15
页数：5
相关论文
共 50 条
  • [1] Face-hitting Dominating Sets in Planar Graphs
    Francis, P.
    Illickan, Abraham M.
    Jose, Lijo M.
    Rajendraprasad, Deepak
    arXiv,
  • [2] HITTING WEIGHTED EVEN CYCLES IN PLANAR GRAPHS
    Goeke, Alexander
    Koenemann, Jochen
    Mnich, Matthias
    Sun, Hao
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (04) : 2830 - 2862
  • [3] Dominating sets in planar graphs
    Matheson, LR
    Tarjan, RE
    EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (06) : 565 - 568
  • [4] The face pair of planar graphs
    Yang Yuansheng
    Lin Xiaohui
    Qiao Jing
    DISCRETE MATHEMATICS, 2006, 306 (15) : 1742 - 1757
  • [5] ON THE FACE PAIR OF CUBIC PLANAR GRAPHS
    CAMPBELL, CM
    STATON, W
    UTILITAS MATHEMATICA, 1995, 48 : 145 - 153
  • [6] Face Labeling Of Maximal Planar Graphs
    Cahit, Ibrahim
    APPLIED MATHEMATICS E-NOTES, 2011, 11 : 1 - 11
  • [7] Face extensions in planar cubic graphs
    Kilakos, K
    Shepherd, FB
    DISCRETE MATHEMATICS, 1998, 181 (1-3) : 179 - 191
  • [8] Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
    Golovach, Petr A.
    Stamoulis, Giannos
    Thilikos, Dimitrios M.
    ACM TRANSACTIONS ON ALGORITHMS, 2023, 19 (03)
  • [9] Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
    Golovach, Petr A.
    Stamoulis, Giannos
    Thilikos, Dimitrios M.
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 931 - 950
  • [10] Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
    Golovach, Petr A.
    Stamoulis, Giannos
    Thilikos, Dimitrios M.
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 931 - 950
12345