Tree-colorable maximal planar graphs

Enqiang Zhu, Zepeng Li, Zehui Shao +1

A tree-coloring of a maximal planar graph is a proper vertex $4$-coloring such that every bichromatic subgraph, induced by this coloring, is a tree. A maximal planar graph $G$ is t…