2022/12/17 by Ibrahim, Hany, Tittmann, Peter
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2212.10354
Given a family of graphs H, a graph G is H-free if any subset of V(G) does not induce a subgraph of G that is isomorphic to any graph in 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 claw-free and line graphs.