当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
On Tuza’s conjecture for triangulations and graphs with small treewidth
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-01-23 , DOI: 10.1016/j.disc.2020.112281 Fábio Botler , Cristina G. Fernandes , Juan Gutiérrez
中文翻译:
关于图萨猜想的三角形和具有小树宽的图
更新日期:2021-01-24
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-01-23 , DOI: 10.1016/j.disc.2020.112281 Fábio Botler , Cristina G. Fernandes , Juan Gutiérrez
Tuza (1981) conjectured that the size of a minimum set of edges that intersects every triangle of a graph is at most twice the size of a maximum set of edge-disjoint triangles of . In this paper we present three results regarding Tuza’s Conjecture. We verify it for graphs with treewidth at most 6; we show that for every planar triangulation different from ; and that if is a maximal graph with treewidth 3. Our first result strengthens a result of Tuza, implying that for every -free chordal graph .
中文翻译:
关于图萨猜想的三角形和具有小树宽的图
Tuza(1981)推测 与图的每个三角形相交的最小边的集合 最多是尺寸的两倍 的最大边不相交三角形的集合 。在本文中,我们提出了关于图扎猜想的三个结果。我们对树宽最大为6的图进行验证。我们表明 对于每个平面三角剖分 不同于 ; 然后 如果 是具有树宽3的最大图。我们的第一个结果加强了Tuza的结果,这意味着 每一个 免和弦图 。