完全图与完全多部图的线图的树宽
组合数学
2014-08-04 v2
摘要
在 Grohe 和 Marx 最近的论文中，完全图的线图的树宽是一个关键示例。我们确定了完全图的线图的精确树宽。通过扩展这些技术，我们确定了正则完全多部图的线图的精确树宽。对于任意完全多部图，我们将线图的树宽确定至低阶项。
引用
@article{arxiv.1210.8205,
title = {Treewidth of the Line Graph of Complete and Complete Multipartite Graphs},
author = {Daniel J. Harvey and David R. Wood},
journal= {arXiv preprint arXiv:1210.8205},
year = {2014}
}
备注
25 pages, 0 figures. Changes in this revision: One minor error fixed, substantial clean-up of text, title changed. A subset of this paper containing the first Theorem and its proof has been published in the Journal of Graph Theory: Harvey, D. J. and Wood, D. R. (2014), Treewidth of the Line Graph of a Complete Graph. J. Graph Theory. doi: 10.1002/jgt.21813