The Linear Arboricity of Graphs with Low Treewidth

IF 0.5 4区数学 Q3 MATHEMATICS

Discussiones Mathematicae Graph Theory Pub Date : 2022-05-27 DOI:10.7151/dmgt.2456

Xiang Tan, Jian-Liang Wu

引用次数: 1

Abstract

Abstract Let G be a graph with treewidth k. In the paper, it is proved that if k ≤ 3 and maximum degree Δ ≥ 5, or k = 4 and Δ ≥ 9, or Δ ≥ 4k − 3 and k ≥ 5, then the linear arboricity la(G) of G is ⌈ Δ2 ⌉ \left\lceil {{\Delta \over 2}} \right\rceil

查看原文本刊更多论文

低树宽图的线性树性

摘要设G为树宽为k的图，证明了当k≤3且最大度Δ≥5，或k = 4且Δ≥9，或Δ≥4k−3且k≥5，则G的线性树性la(G)为≤≤Δ2²\left\lceil{{\Delta\over 2}} \right\rceil

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discussiones Mathematicae Graph Theory MATHEMATICS-

CiteScore

2.20

自引率

0.00%

发文量

审稿时长

53 weeks

期刊介绍： The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.