๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Local Tree-Width, Excluded Minors, and Approximation Algorithms

โœ Scribed by Martin Grohe

Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
276 KB
Volume
23
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Tree-width, clique-minors, and eigenvalu
Tree-width, clique-minors, and eigenvalues
โœ Yuan Hong ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 187 KB

Let G be a simple graph with n vertices and tw(G) be the tree-width of G. Let (G) be the spectral radius of G and (G) be the smallest eigenvalue of G. The join Gโˆ‡H of disjoint graphs of G and H is the graph obtained from G + H by joining each vertex of G to each vertex of H . In this paper, several

Surfaces, Tree-Width, Clique-Minors, and
Surfaces, Tree-Width, Clique-Minors, and Partitions
โœ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 214 KB

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