1 paper
Yuan Ren, Jing Zhang, Zhiyuan Zhang
A graph G is H-free, if it contains no H as a subgraph. A graph is said to be \emph{H-minor free}, if it does not contain H as a minor. In recent years, Nikiforov asked t…