Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girth

Yoshimi Egawa, Michitaka Furuya

For a family $\mathcal{H}$ of graphs, a graph $G$ is said to be {\it $\mathcal{H}$-free} if $G$ contains no member of $\mathcal{H}$ as an induced subgraph. We let $\tilde{\mathcal{…