Algorithmic aspects of linear k-arboricity
摘要：
For a fixed positive integer k, the linear k-arboricity la(k)(G) of a graph G is the minimum number l such that the edge set E(G) can be partitioned into l disjoint sets, each induces a subgraph whose components are paths of lengths at most k. This paper examines linear k-arboricity from an algorithmic point of view. In particular, we present a linear-time algorithm for determining whether a tree T has la(2)(T) less than or equal to m. We also give a characterization for a tree T with maximum degree 2m having la(2)(T) = m.
展开
关键词：
linear forest linear k-forest linear arboricity linear k-arboricity tree leaf penultimate vertex algorithm NP-complete
DOI：
http://dx.doi.org/
被引量：
年份：
1999
国家科技图书文献中心
(权威机构)
掌桥科研
Semantic Scholar
(全网免费下载)
ResearchGate
Citeseer
查看更多
Citeseer
(全网免费下载)
ir.nctu.edu.tw
journal.tms.org.tw
journal.taiwanmathsoc.org.tw
(全网免费下载)
projecteuclid.org
zentralblatt-math.org
140.113.37.243
hdl.handle.net
journal.tms.org.tw
(全网免费下载)
citeseer.ist.psu.edu
(全网免费下载)
journal.taiwanmathsoc.org.tw
AMS
Semantic Scholar
(全网免费下载)
Citeseer
(全网免费下载)
citeseer.ist.psu.edu
(全网免费下载)
journal.tms.org.tw
(全网免费下载)
journal.taiwanmathsoc.org.tw
(全网免费下载)
通过文献互助平台发起求助，成功后即可免费获取论文全文。
相似文献
参考文献
引证文献
来源期刊
引用走势
辅助模式
引用
文献可以批量引用啦~
欢迎点我试用！
