On the treewidths of graphs of bounded degree.
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.
| मुख्य लेखकों: | , |
|---|---|
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
Public Library of Science (PLoS)
2015-01-01
|
| श्रृंखला: | PLoS ONE |
| ऑनलाइन पहुंच: | http://europepmc.org/articles/PMC4388525?pdf=render |