𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph minors. III. Planar tree-width

✍ Scribed by Neil Robertson; P.D Seymour

Book ID
107884191
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
798 KB
Volume
36
Category
Article
ISSN
0095-8956

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

Ka,k Minors in Graphs of Bounded Tree-Wi
Ka,k Minors in Graphs of Bounded Tree-Width
✍ Thomas BΓΆhme; John Maharry; Bojan Mohar πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 175 KB

It is shown that for any positive integers k and w there exists a constant N ¼ N ðk; wÞ such that every 7-connected graph of tree-width less than w and of order at least N contains K 3;k as a minor. Similar result is proved for K a;k minors where a is an arbitrary fixed integer and the required conn

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