✦ LIBER ✦

On Universal Graphs With Forbidden Topological Subgraphs

✍ Scribed by Diestel, Reinhard

Book ID: 123065103
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 490 KB
Volume: 6
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(85)80008-1

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

Forbidden subgraphs for graphs with plan

Forbidden subgraphs for graphs with planar line graphs

✍ D.L. Greenwell; Robert L. Hemminger 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 355 KB

On automorphisms of infinite graphs with

On automorphisms of infinite graphs with forbidden subgraphs

✍ Norbert Seifter 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 334 KB

Automorphism groups of graphs with forbi

Automorphism groups of graphs with forbidden subgraphs

✍ Gerhard Behrendt 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 207 KB

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

Dominating subgraphs in graphs with some

Dominating subgraphs in graphs with some forbidden structures

✍ Jiping Liu; Huishan Zhou 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 387 KB

We characterize the triangle-free graphs with neither induced path of six vertices nor induced cycle of six vertices and the triangle-free graphs without induced path of six vertices in terms of dominating subgraphs.