| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6423724 | Electronic Notes in Discrete Mathematics | 2016 | 6 Pages |
Abstract
We conjecture that any graph G with treewidth k and maximum degree Î(G)â¥k+k satisfies Ïâ²(G)=Î(G). In support of the conjecture we prove its fractional version.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Henning Bruhn, Laura Gellert, Richard Lang,