Graphs with Induced-Saturation Number Zero

Given graphs $G$ and $H$, $G$ is $H$-saturated if $H$ is not a subgraph of $G$, but for all $e \notin E(G)$, $H$ appears as a subgraph of $G + e$. While for every $n \ge |V(H)|$, there exists an $n$-vertex graph that is $H$-saturated, the same does not hold for induced subgraphs. That is, there exis...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The Electronic journal of combinatorics 2016-03, Vol.23 (1)
Hauptverfasser:	Behrens, Sarah, Erbes, Catherine, Santana, Michael, Yager, Derrek, Yeager, Elyse
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!