2 problems

Erdős–Nešetřil conjecture. Every graph $G$ satisfies

Let $G$ be a planar graph with maximum degree at most $3$; such a graph is called planar subcubic. The Faudree et al. conjecture. If $G$ is a planar subcubic graph, then … This con…