✦ LIBER ✦

Forbidden graphs for classes of split-like graphs

✍ Scribed by Drgas-Burchardt, Ewa

Book ID: 122165806
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 450 KB
Volume: 39
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.12.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Forbidden Induced Subgraphs of Double-sp

Forbidden Induced Subgraphs of Double-split Graphs

✍ Alexeev, Boris; Fradkin, Alexandra; Kim, Ilhee 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 207 KB

Retractions of split graphs and End-orth

Retractions of split graphs and End-orthodox split graphs

✍ Suohai Fan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

Forbidden minors for the class of graphs

Forbidden minors for the class of graphs G with

✍ Leslie Hogben; Hein van der Holst 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 166 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

Cutwidth of Split Graphs and Threshold G

Cutwidth of Split Graphs and Threshold Graphs

✍ Heggernes, Pinar; Lokshtanov, Daniel; Mihai, Rodica; Papadopoulos, Charis 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 418 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.