✦ LIBER ✦

The number of graphs without forbidden subgraphs

✍ Scribed by József Balogh; Béla Bollobás; Miklós Simonovits

Book ID: 108167358
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 344 KB
Volume: 91
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2003.08.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangle-free graphs without forbidden s

Triangle-free graphs without forbidden subgraphs

✍ S. Brandt 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 12 KB

Forbidden subgraphs for graphs with line

Forbidden subgraphs for graphs with line graphs of crossing number ≤1

✍ D. G. Akka; S. V. Panshetty 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 403 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 the chromatic number of a graph with

On the chromatic number of a graph with two forbidden subgraphs

✍ Medha Dhurandhar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Automorphism groups of graphs with forbi

Automorphism groups of graphs with forbidden subgraphs

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

Forbidden subgraphs and Hamiltonian prop

Forbidden subgraphs and Hamiltonian properties of graphs

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 344 KB