𝔖 Bobbio Scriptorium
✦   LIBER   ✦

NOTE Spectral Characterization of Tree-Width-Two Graphs

✍ Scribed by Andrei Kotlov


Book ID
106167885
Publisher
Springer-Verlag
Year
2000
Tongue
English
Weight
143 KB
Volume
20
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Partitioning Graphs of Bounded Tree-Widt
✍ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan πŸ“‚ Article πŸ“… 1998 πŸ› Springer-Verlag 🌐 English βš– 199 KB
Tree-width and circumference of graphs
✍ Etienne Birmele πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 37 KB

## 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