Scholarlink

We study the parameterized complexity of the Vertex-Disjoint Triangle Packing problem in graphs with bounded degree and tripartite graphs. We show that this problem admits a linear kernel of size 15k in graphs with maximum degree four, and an improved quadratic kernel of size \(30k^2\) in tripartite graphs.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Triangle Packing in Graphs with Bounded Degree

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Yong Zhang

摘要

We study the parameterized complexity of the Vertex-Disjoint Triangle Packing problem in graphs with bounded degree and tripartite graphs. We show that this problem admits a linear kernel of size 15k in graphs with maximum degree four, and an improved quadratic kernel of size \(30k^2\) in tripartite graphs.