Tree-width of hypergraphs and surface duality
✍ Scribed by Frédéric Mazoit
- Book ID
- 113698919
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 332 KB
- Volume
- 102
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In 1971, Chartrand, Geller, and Hedetniemi conjectured that the edge set of a planar graph may be partitioned into two subsets, each of which induces an outerplanar graph. Some partial results towards this conjecture are presented. One such result, in which a planar graph may be thus edge partitione
## Abstract We prove that every graph of circumference __k__ has tree‐width at most __k__ − 1 and that this bound is best possible. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 24–25, 2003
Using multiplicities of eigenvalues of elliptic self-adjoint differential operators on graphs and transversality, we construct some new invariants of graphs which are related to tree-width.