Edge Contraction and Forbidden Induced Graphs

MaRDI QIDQ6393041zbMATH OpenFDO

Authors H. Ibrahim, Peter Tittmann

Publication date 7 March 2022

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Abstract: A graph $G$ is $H$-free if any subset of $V(G)$ does not induce a subgraph of $G$ that is isomorphic to $H$. Given a graph $H$, we present sufficient and necessary conditions for a graph $G$ such that $G/e$ is $H$-free for any edge $e$ in $E(G)$. Thereafter, we use these conditions to characterize forests, claw-free, $2K_2$-free, $C_4$-free, $C_5$-free, split, and pseudo-split graphs.

This page was built for publication: Edge Contraction and Forbidden Induced Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6393041)