Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles

Zhengjiao Liu, Tao Wang, Xiaojing Yang

A graph is \emph{$(\mathcal{I},\mathcal{F})$-partitionable} if its vertex set can be partitioned into two parts such that one part $\mathcal{I}$ is an independent set, and the oth…