Packing and Covering Triangles in Planar Graphs

被引：9
|
作者：
Cui, Qing [1 ]
Haxell, Penny [2 ]
Ma, Will [2 ]
机构：
[1] Nanjing Univ Aeronaut & Astronaut, Dept Math, Nanjing 210016, Peoples R China
[2] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
来源：
GRAPHS AND COMBINATORICS | 2009年 / 25卷 / 06期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Packing and covering; Triangle; Planar graph; CONJECTURE;
D O I：
10.1007/s00373-010-0881-5
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Tuza conjectured that if a simple graph G does not contain more than k pairwise edge-disjoint triangles, then there exists a set of at most 2k edges that meets all triangles in G. It has been shown that this conjecture is true for planar graphs and the bound is sharp. In this paper, we characterize the set of extremal planar graphs.
引用
收藏
页码：817 / 824
页数：8
相关论文
共 50 条
  • [1] Packing and Covering Triangles in Planar Graphs
    Qing Cui
    Penny Haxell
    Will Ma
    [J]. Graphs and Combinatorics, 2009, 25 : 817 - 824
  • [2] Packing and covering triangles in graphs
    Haxell, PE
    [J]. DISCRETE MATHEMATICS, 1999, 195 (1-3) : 251 - 254
  • [3] Packing and Covering Triangles in K 4-free Planar Graphs
    Haxell, Penny
    Kostochka, Alexandr
    Thomasse, Stephan
    [J]. GRAPHS AND COMBINATORICS, 2012, 28 (05) : 653 - 662
  • [4] Packing and Covering Triangles in K4-free Planar Graphs
    Penny Haxell
    Alexandr Kostochka
    Stéphan Thomassé
    [J]. Graphs and Combinatorics, 2012, 28 : 653 - 662
  • [5] Packing and Covering Triangles in Tripartite Graphs
    P. E. Haxell
    Y. Kohayakawa
    [J]. Graphs and Combinatorics, 1998, 14 : 1 - 10
  • [6] Packing and covering triangles in tripartite graphs
    Haxell, PE
    Kohayakawa, Y
    [J]. GRAPHS AND COMBINATORICS, 1998, 14 (01) : 1 - 10
  • [7] Packing and Covering Directed Triangles
    McDonald, Jessica
    Puleo, Gregory J.
    Tennenhouse, Craig
    [J]. GRAPHS AND COMBINATORICS, 2020, 36 (04) : 1059 - 1063
  • [8] Packing and Covering Directed Triangles
    Jessica McDonald
    Gregory J. Puleo
    Craig Tennenhouse
    [J]. Graphs and Combinatorics, 2020, 36 : 1059 - 1063
  • [9] Packing and Covering Immersion Models of Planar Subcubic Graphs
    Giannopoulou, Archontia C.
    Kwon, O-joung
    Raymond, Jean-Florent
    Thilikos, Dimitrios M.
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2016, 2016, 9941 : 74 - 84
  • [10] Packing and covering directed triangles asymptotically
    Cooper, Jacob W.
    Grzesik, Andrzej
    Kabela, Adam
    Kral', Daniel
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2022, 101
12345