title: On the treewidths of graphs of bounded degree.
abstract: In this paper, we develop a new technique to study the treewidth of graphs with bounded degree. We show that the treewidth of a graph G = (V, E) with maximum vertex degree d is at most [Formula: see text] for sufficiently large d, where C is a constant.
authors: School of Electronics and Information Science Jiangsu University of Science and Technology Zhenjiang, Jiangsu 212003, China.
authors: Yinglei
authors: Y
authors: Song
authors: School of Electronics and Information Science Jiangsu University of Science and Technology Zhenjiang, Jiangsu 212003, China.
authors: Menghong
authors: M
authors: Yu
mesh_terms: D000465:Algorithms; D055592:Biophysical Phenomena; D003196:Computer Graphics; D006801:Humans; D008958:Models, Molecular; D011789:Quantum Theory