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

On automorphisms of infinite graphs with forbidden subgraphs

โœ Scribed by Norbert Seifter

Book ID
110564201
Publisher
Springer-Verlag
Year
1984
Tongue
English
Weight
334 KB
Volume
4
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On planar intersection graphs with forbi
On planar intersection graphs with forbidden subgraphs
โœ Jรกnos Pach; Micha Sharir ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 154 KB

## Abstract Let ${\cal C}$ be a family of __n__ compact connected sets in the plane, whose intersection graph $G({\cal C})$ has no complete bipartite subgraph with __k__ vertices in each of its classes. Then $G({\cal C})$ has at most __n__ times a polylogarithmic number of edges, where the exponent

Traceability in graphs with forbidden tr
Traceability in graphs with forbidden triples of subgraphs
โœ Ronald J. Gould; John M. Harris ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 724 KB

If 9 is a collection of connected graphs, and if a graph G does not contain any member of 9 as an induced subgraph, then G is said to be F-free. The members of f in this situation are called forbidden subgraphs. In a previous paper (Gould and Harris, 1995) the authors demonstrated two families of tr