4-Separations in Haj\'{o}s Graphs

Abstract

As a natural extension of the Four Color Theorem, Haj\'{o}s conjectured that graphs containing no $K_5$-subdivision are 4-colorable. Any possible counterexample to this conjecture with minimum number of vertices is called a {\it Haj\'{o}s graph}. Previous results show that Haj\'{o}s graphs are 4-connected but not 5-connected. A $k$-separation in a graph $G$ is a pair $(G_1,G_2)$ of edge-disjoint subgraphs of $G$ such that $|V(G_1\cap G_2)|=k$, $G=G_1\cup G_2$, and $G_i\not\subseteq G_{3-i}$ for $i=1,2$. In this paper, we show that Haj\'{o}s graphs do not admit a 4-separation $(G_1,G_2)$ such that $|V(G_1)|\ge 6$ and $G_1$ can be drawn in the plane with no edge crossings and all vertices in $V(G_1\cap G_2)$ incident with a common face. This is a step in our attempt to reduce Haj\'{o}s' conjecture to the Four Color Theorem.