✦ LIBER ✦

Forbidden subgraph decomposition

✍ Scribed by Irena Rusu; Jeremy Spinrad

Book ID: 108315660
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 96 KB
Volume: 247
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00173-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Forbidden subgraphs and graph decomposit

Forbidden subgraphs and graph decomposition

✍ Donald K. Wagner 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 324 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.

Forbidden Induced Subgraphs for Toughnes

Forbidden Induced Subgraphs for Toughness

✍ Katsuhiro Ota; Gabriel Sueiro 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 572 KB

Eigenvalues and forbidden subgraphs I

✍ Vladimir Nikiforov 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 116 KB

3-Colourability and Forbidden Subgraphs

✍ Bert Randerath 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 319 KB

Stability for large forbidden subgraphs

✍ Vladimir Nikiforov 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract In this note we strengthen the stability theorem of Erdős and Simonovits. Write __K__~__r__~(__s__~1~, …, __s__~__r__~) for the complete __r__‐partite graph with classes of sizes __s__~1~, …, __s__~__r__~ and __T__~__r__~(__n__) for the __r__‐partite Turán graph of order __n__. Our main