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 条
  • [41] Large Independent Sets in Triangle-Free Planar Graphs
    Dvorak, Zdenek
    Mnich, Matthias
    ALGORITHMS - ESA 2014, 2014, 8737 : 346 - 357
  • [42] PARALLEL ALGORITHMS FOR FRACTIONAL AND MAXIMAL INDEPENDENT SETS IN PLANAR GRAPHS
    DADOUN, N
    KIRKPATRICK, DG
    DISCRETE APPLIED MATHEMATICS, 1990, 27 (1-2) : 69 - 83
  • [43] Small Point Sets for Simply-Nested Planar Graphs
    Angelini, Patrizio
    Di Battista, Giuseppe
    Kaufmann, Michael
    Mchedlidze, Tamara
    Roselli, Vincenzo
    Squarcella, Claudio
    GRAPH DRAWING, 2012, 7034 : 75 - +
  • [44] Zero-sum magic and null sets of planar graphs
    Salehi, Ebrahim
    Hansen, Samuel
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2010, 72 : 55 - 64
  • [45] Local super antimagic total face coloring of planar graphs
    Nisviasari, R.
    Dafik
    Maryati, T. K.
    Agustin, I. H.
    Kurniawati, E. Y.
    FIRST INTERNATIONAL CONFERENCE ON ENVIRONMENTAL GEOGRAPHY AND GEOGRAPHY EDUCATION (ICEGE), 2019, 243
  • [46] A Face Cover Perspective to f 1 Embeddings of Planar Graphs
    Filtser, Arnold
    ACM TRANSACTIONS ON ALGORITHMS, 2025, 21 (01)
  • [47] Path Hitting in Acyclic Graphs
    Parekh, Ojas
    Segev, Danny
    ALGORITHMICA, 2008, 52 (04) : 466 - 486
  • [48] Path Hitting in Acyclic Graphs
    Ojas Parekh
    Danny Segev
    Algorithmica, 2008, 52 : 466 - 486
  • [49] Path hitting in acyclic graphs
    Parekh, Ojas
    Segev, Danny
    ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 564 - 575
  • [50] Clique-transversal sets and clique-coloring in planar graphs
    Shan, Erfang
    Liang, Zuosong
    Kang, Liying
    EUROPEAN JOURNAL OF COMBINATORICS, 2014, 36 : 367 - 376
12345