✦ LIBER ✦

Colouring of graphs with Ramsey-type forbidden subgraphs

✍ Scribed by Dabrowski, Konrad K.; Golovach, Petr A.; Paulusma, Daniel

Book ID: 122167616
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 321 KB
Volume: 522
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.12.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey-type Theorems with Forbidden Subg

Ramsey-type Theorems with Forbidden Subgraphs

✍ Noga Alon; János Pach; József Solymosi 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 250 KB

The Ramsey property for graphs with forb

The Ramsey property for graphs with forbidden complete subgraphs

✍ Jaroslav Nešetřil; Vojtěch Rödl 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 306 KB

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

Automorphism groups of graphs with forbi

Automorphism groups of graphs with forbidden subgraphs

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

Forbidden ordered subgraph vs. forbidden

Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes

✍ Ginn, Mark 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

We show that the minimum set of unordered graphs that must be forbidden to get the same graph class characterized by forbidding a single ordered graph is infinite.

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