On the structure of graphs excluding $K_4$, $W_4$, $K_{2,4}$ and one other graph as a rooted minor

Abstract

In this paper we give structural characterizations of graphs not containing rooted $K_4$, $W_4$, $K_{2,4}$, and a graph we call $L$.

35 pages, 12 figures

References in corpus (1)

• Thomassen's Choosability Argument Revisited