Forbidden pairs for equality of edge-connectivity and minimum degree

Abstract

Let $\mathcal{H}$ be a class of given graphs. A graph $G$ is said to be $\mathcal{H}$-free if $G$ contains no induced copies of $H$ for any $H\in \mathcal{H}$. In this article, we characterize all pairs $\{R,S\}$ of graphs such that every connected $\{R,S\}$-free graph has the same edge-connectivity and minimum degree.