Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs without Theta Graphs Θ_2,1,2

Abstract

A theta graph ${\mathsf{\Theta }}_{2,1,2}$ is a graph obtained by joining two vertices by three internally disjoint paths of lengths 2, 1, and 2. A neighbor sum distinguishing (NSD) total coloring $\varphi$ of G is a proper total coloring of G such that ${\sum }_{z\in E_G\left(u\right)\cup \{u\}}\varphi \left(z\right)\ne {\sum }_{z\in E_G\left(v\right)\cup \{v\}}\varphi \left(z\right)$ for each edge $uv\in E\left(G\right)$, where $E_G\left(u\right)$ denotes the set of edges incident with a vertex u. In 2015, Pilśniak and Woźniak introduced this coloring and conjectured that every graph with maximum degree $\mathsf{\Delta }$ admits an NSD total $(\mathsf{\Delta }+3)$-coloring. In this paper, we show that the listing version of this conjecture holds for any IC-planar graph with maximum degree $\mathsf{\Delta }\ge 9$ but without theta graphs ${\mathsf{\Theta }}_{2,1,2}$ by applying the Combinatorial Nullstellensatz, which improves the result of Song et al.

1. Introduction

The graphs mentioned in this paper are finite, undirected, and simple. For undefined terminology and notations, here we follow [1]. Let $G=\left(V\right(G),E(G\left)\right)$ be a simple graph. For a vertex $u\in V\left(G\right)$, let $E_G\left(u\right)$ denote the set of edges incident with u, and we use $d_G\left(u\right)$ and $N_G\left(u\right)$ to represent the degree and the neighborhood of u, respectively. Let $\mathsf{\Delta }\left(G\right)$ (or $\mathsf{\Delta }$) and $\delta \left(G\right)$ (or $\delta$) denote the maximum degree and the minimum degree of G, respectively. A t-cycle ($t^{+}$-cycle, $t^{-}$-cycle) is a cycle of length t (at least t, at most t). In particular, a 3-cycle with vertex set $\{v_1,v_2,v_3\}$ is called a $(d_G\left(v_1\right),d_G\left(v_2\right),d_G\left(v_3\right))$-cycle. A theta graph ${\mathsf{\Theta }}_{t_1,t_2,t_3}$ is a graph obtained by joining two vertices by three internally disjoint paths of lengths $t_1$, $t_2$ and $t_3$.

Let k be a positive integer and $T\left(G\right)=V\left(G\right)\cup E\left(G\right)$. A mapping $\varphi :T\left(G\right)\to \{1,\dots ,k\}$ is called a proper k-total coloring of G if $\varphi \left(z_1\right)\ne \varphi \left(z_2\right)$ for any two adjacent or incident elements $z_1,z_2$ in $T\left(G\right)$. A proper k-total coloring $\varphi$ of G is neighbor sum distinguishing (for short, NSD) if for each edge $uv\in E\left(G\right)$,

$$\sum _{z\in E_G\left(u\right)\cup \{u\}}\varphi \left(z\right)\ne \sum _{z\in E_G\left(v\right)\cup \{v\}}\varphi \left(z\right).$$

The NSD total chromatic number of G, denoted by ${\chi }_{\Sigma }^t\left(G\right)$, is the smallest integer k such that G has an NSD k-total coloring. Pilśniak and Woźniak [2] posed an important conjecture in the following.

Conjecture 1

([2]). For a graph G, ${\chi }_{\Sigma }^t\left(G\right)\le \mathsf{\Delta }\left(G\right)+3$.

Pilśniak and Woźniak [2] showed that Conjecture 1 holds for complete graphs, bipartite graphs, cubic graphs, and 2-degenerate graphs with maximum degree $\mathsf{\Delta }\le 3$. Yao et al. [3] confirmed this conjecture for any 2-degenerate graph. Li et al. [4] verified the conjecture for $K_4$-minor free graphs. Yang et al. [5] proved that any planar graph with maximum degree $\mathsf{\Delta }=10$ satisfies this conjecture.

An $IC$-planar graph, introduced by Alberson [6] in 2008, is a graph that can be embedded in a plane such that each edge is crossed at most one other edge and two pairs of crossing edges share no common end vertex, i.e., two distinct crossings are independent. There are also many results about the NSD total coloring of IC-planar as follows.

Theorem 1

([7,8,9]). Conjecture 1 holds for the following families of IC-planar graphs.

(1) Any IC-planar graph with maximum degree $\mathsf{\Delta }\ge 13$.

(2) Every IC-planar graph with maximum degree $\mathsf{\Delta }\ge 7$ but without 3-cycles.

(3) Any IC-planar graph with maximum degree $\mathsf{\Delta }\ge 10$ but without theta graphs ${\mathsf{\Theta }}_{2,1,2}$.

A k-list total assignment of G is a mapping L that assigns to each member $z\in T\left(G\right)$ a set $L\left(z\right)$ of k real numbers. For a list total assignment L of G, a mapping $\varphi$ is called an NSD total L-coloring of G if $\varphi$ is an NSD total coloring of G and $\varphi \left(z\right)\in L\left(z\right)$ for each $z\in T\left(G\right)$. The smallest integer k such that G has an NSD total L-coloring for any k-list total assignment L is called the NSD total choice number of G, denoted by ${\mathrm{ch}}_{\Sigma }^t\left(G\right)$. Clearly, ${\chi }_{\Sigma }^t\left(G\right)\le {\mathrm{ch}}_{\Sigma }^t\left(G\right)$.

There are also many results about the list version of Conjecture 1 in the following.

Conjecture 2

([2]). For a graph G, ${\mathrm{ch}}_{\Sigma }^t\left(G\right)\le \mathsf{\Delta }\left(G\right)+3$.

Obviously, Conjecture 2 implied Conjecture 1. Qu et al. [10] proved that this conjecture holds for any planar graph G with maximum degree $\mathsf{\Delta }\left(G\right)\ge 13$. Wang et al. [11] confirmed Conjecture 2 for every planar graph G with maximum degree $\mathsf{\Delta }\left(G\right)\ge 8$ but without theta graphs ${\mathsf{\Theta }}_{2,1,2}$. Song et al. [12] discussed the NSD total L-coloring of any IC-planar graph and obtained the following theorem.

Theorem 2

([12]). Let G be an IC-planar graph. Then, ${\mathrm{ch}}_{\Sigma }^t\left(G\right)\le max\{\mathsf{\Delta }\left(G\right)+3,17\}$.

In this paper, we reduce the condition $\mathsf{\Delta }\ge 10$ of (3) in Theorem 1 to $\mathsf{\Delta }\ge 9$ and obtain the list version result as follows.

Theorem 3.

Let G be an IC-planar graph without theta graphs ${\mathsf{\Theta }}_{2,1,2}$. Then,

$${\mathrm{ch}}_{\Sigma }^t\left(G\right)\le max\{\mathsf{\Delta }\left(G\right)+3,12\}.$$

2. Preliminaries

Let G be a simple graph. An ℓ-vertex (${\ell }^{+}$-vertex, ${\ell }^{-}$-vertex) u of G is a vertex with $d_G\left(u\right)=\ell$ ($d_G\left(u\right)\ge \ell$, $d_G\left(u\right)\le \ell$). We use $n_G^{\ell }\left(u\right)$ ($n_G^{{\ell }^{+}}\left(u\right)$, $n_G^{{\ell }^{-}}\left(u\right)$) to denote the number of ℓ-vertices (${\ell }^{+}$-vertices, ${\ell }^{-}$-vertices) adjacent to u.

In 1999, Alon developed a general algebraic technique that is called Combinatorial Nullstellensatz. It has numerous applications in additive number theory, combinatorics, and graph coloring problems. In the paper, we also use Combinatorial Nullstellensatz in the following to discuss the local structure of minimal counterexample to Theorem 3.

Lemma 1

([13]). Let $\mathbb{F}$ be an arbitrary field and $P\in \mathbb{F}[x_1,\dots ,x_n]$ with degree $deg\left(P\right)={\sum }_{k=1}^n{i}_k$, where each $i_k$ is a natural integer. If the coefficient $c_P(x_1^{i_1}\dots x_n^{i_n})$ of the monomial $x_1^{i_1}\dots x_n^{i_n}$ in P is nonzero, and if $S_1,\dots ,S_n$ are subsets of $\mathbb{F}$ with $|S_k|>i_k$, then there are $s_1\in S_1,\dots ,s_n\in S_n$ such that $P(s_1,\dots ,s_n)\ne 0$.

Let $t\ge 2$ be a positive integer and $S_1,\dots ,S_t$ be t finite sets of real numbers. Define

$$S=S_1\oplus S_2\oplus \dots \oplus S_t=\{\sum _{i=1}^t{s}_i|s_i\in S_{i}and{s}_i\ne s_{j}for1\le i<j\le t\}.$$

Lemma 2

([10]). Let $t\ge 2$ be a positive integer and $S_1,\dots ,S_t$ be t finite sets of real numbers, where $|S_i|=n_i$ and $n_1\ge \dots \ge n_t.$ Define $n_1^{\prime },\dots ,n_t^{\prime }$ by

$$n_1^{\prime }=n_{1}and{n}_i^{\prime }=min\{n_{i-1}^{\prime }-1,n_i\},for2\le i\le t.$$

If $n_i^{\prime }>0$ for $1\le i\le t$, then

$$\left|S\right|\ge \sum _{i=1}^t{n}_i^{\prime }-\frac{1}{2}t(t+1)+1.$$

3. Proof of Theorem 3

Let G be a counterexample to Theorem 3 with $\left|E\right(G\left)\right|$ being minimal and $k=max\{\mathsf{\Delta }(G)+3,12\}$. For any k-list total assignment L, every subgraph $G^{\prime }$ of G has an NSD total L-coloring ${\varphi }^{\prime }$ by the minimality of G. In the following, we will extend the NSD total L-coloring ${\varphi }^{\prime }$ of $G^{\prime }$ to an NSD total L-coloring $\varphi$ of G to obtain a contradiction. As $G^{\prime }$ is a subgraph of G, we have $T\left(G\right)\cap T\left(G’\right)=T\left(G’\right)$. Not stated otherwise, $\varphi \left(z\right)={\varphi }^{\prime }\left(z\right)$ for any $z\in T\left(G^{\prime }\right)$. Let $m\left(u\right)={\sum }_{z\in E_G\left(u\right)\cup \{u\}}\varphi \left(z\right)$. For the coloring ${\varphi }^{\prime }$, the definition of $m^{\prime }\left(u\right)$ is the same as $m\left(u\right)$. Let X be a subset of $T\left(G\right)$ and $\theta :X\to \mathbb{R}$ be a mapping. For each $z\in T\left(G\right)$, let $S\left(z\right)=L\left(z\right)\backslash \{\theta (x\left)\right|x\in X\mathrm{and}x\mathrm{is}\mathrm{adjacent}\mathrm{or}\mathrm{incident}\mathrm{to}z\mathrm{in}G\}.$

Assume that u is a $3^{-}$-vertex of G. For any k-list total assignment L of G, let a map ${\varphi }^{\prime }:T\left(G\right)\backslash \{u\}\to \mathbb{R}$ satisfy the following three conditions:

(i)

${\varphi }^{\prime }\left(z\right)\in L\left(z\right)$ for every $z\in T\left(G\right)\backslash \{u\}$;

(ii)

${\varphi }^{\prime }\left(z_1\right)\ne {\varphi }^{\prime }\left(z_2\right)$ for any two adjacent or incident members $z_1,z_2\in T\left(G\right)\backslash \{u\}$;

(iii)

${\displaystyle \sum _{z\in E_G\left(v_1\right)\cup \{v_1\}}}{\varphi }^{\prime }\left(z\right)\ne {\displaystyle \sum _{z\in E_G\left(v_2\right)\cup \{v_2\}}}{\varphi }^{\prime }\left(z\right)$ for any two adjacent vertices $v_1,v_2\in V\left(G\right)\backslash \{u\}$.

As $\left|S\left(u\right)\right|\ge k-2d_G\left(u\right)>d_G\left(u\right)+1$ follows from the assumption that $k\ge 12$ and $d_G\left(u\right)\le 3$, there is a color in $S\left(u\right)$ to color u such that the resulting coloring $\varphi$ obtained from ${\varphi }^{\prime }$ satisfies $m\left(u\right)\ne m^{\prime }\left(z\right)$ for each $z\in N_G\left(u\right)$ and $\varphi \left(u\right)\ne {\varphi }^{\prime }\left(z\right)$ for each $z\in N_G\left(u\right)\cup E_G\left(u\right)$. Therefore, $\varphi$ satisfies the definition of NSD total L-coloring. Therefore, ${\varphi }^{\prime }$ can be extend to an NSD total L-coloring $\varphi$ of G. Thus, for simplicity, we will omit the colors of all $3^{-}$-vertices in the following.

Theorem 3 follows from Theorem 2 if $\mathsf{\Delta }\left(G\right)>13$. Thus, the following Claim 1 is immediate.

Claim 1.

$\mathsf{\Delta }\left(G\right)\le 13$.

Claim 2.

There is no edge $uv$ in G with $d_G\left(u\right)\le 5$ and $d_G\left(v\right)\le 4.$

Proof. 

By contradiction, suppose that there is an edge $uv$ in G with $d_G\left(u\right)\le 5$ and $d_G\left(v\right)\le 4.$ Without loss of generality, set $d_G\left(u\right)=5$ and $d_G\left(v\right)=4.$ Let $G^{\prime }=G-uv$. Then, $G^{\prime }$ has an NSD total L-coloring ${\varphi }^{\prime }$. In order to extend the coloring ${\varphi }^{\prime }$ to an NSD total L-coloring $\varphi$ of G, we erase the colors on u and v. Then,

$$\begin{array}{cc}\hfill \left|S\right(u\left)\right|& \ge k-2(d_G\left(u\right)-1)\ge 4,\hfill \\ \hfill \left|S\right(uv\left)\right|& \ge k-(d_G\left(u\right)-1)-(d_G\left(v\right)-1)\ge 5,and\hfill \\ \hfill \left|S\right(v\left)\right|& \ge k-2(d_G\left(v\right)-1)\ge 6.\hfill \end{array}$$

Assign a variable $x_1$ to u, a variable $y_1$ to $uv$ and a variable $x_2$ to v, respectively. Let

$$\begin{array}{ccc}\hfill P(x_1,y_1,x_2)& =& (x_1-y_1)(x_1-x_2)(x_2-y_1)\left(m\left(u\right)-m\left(v\right)\right)\hfill \\ & & ·\prod _{z\in N_G\left(u\right)\backslash \{v\}}\left(m\left(u\right)-m^{\prime }\left(z\right)\right)\prod _{z\in N_G\left(v\right)\backslash \{u\}}\left(m\left(v\right)-m^{\prime }\left(z\right)\right),\hfill \end{array}$$

where $m\left(u\right)=x_1+y_1+m^{\prime }\left(u\right)-{\varphi }^{\prime }\left(u\right)$ and $m\left(v\right)=x_2+y_1+m^{\prime }\left(v\right)-{\varphi }^{\prime }\left(v\right)$. By Appendix A, we know that $c_P\left(x_1^3{y}_1^4{x}_2^4\right)=5.$ By Lemma 1, there are $s_1\in S\left(u\right),s_2\in S\left(uv\right)$ and $s_3\in S\left(v\right)$ such that $P(s_1,s_2,s_3)\ne 0$. By the definitions of P and NSD total L-coloring, we can extend ${\varphi }^{\prime }$ to an NSD total L-coloring $\varphi$ of G by recoloring u and v with colors $s_1,s_3$ and coloring $uv$ with color $s_2$. It is a contradiction. □

Claim 3.

There is no edge $uv$ in G with $d_G\left(u\right)\le 6$ and $d_G\left(v\right)\le 2.$

Proof. 

Suppose to be contrary that there is an edge $uv$ in G with $d_G\left(u\right)\le 6$ and $d_G\left(v\right)\le 2.$ Without loss of generality, set $d_G\left(u\right)=6$. Let $G^{\prime }=G-uv$. Then, $G^{\prime }$ has an NSD total L-coloring ${\varphi }^{\prime }$. In order to extend the coloring ${\varphi }^{\prime }$ to an NSD total L-coloring $\varphi$ of G, we erase the colors on u and v. Note that v is a $2^{-}$-vertex. The color of v can be omitted when we extend ${\varphi }^{\prime }$ to an NSD total L-coloring $\varphi$ of G. Then,

$$\begin{array}{cc}\hfill \left|S\right(u\left)\right|& \ge k-2(d_G\left(u\right)-1)\ge 2,and\hfill \\ \hfill \left|S\right(uv\left)\right|& \ge k-(d_G\left(u\right)-1)-(d_G\left(v\right)-1)\ge 6.\hfill \end{array}$$

By Lemma 2, we have that

$$|S\left(u\right)\oplus S\left(uv\right)|\ge 2+6-\frac{1}{2}\times 2\times 3+1>d_G\left(u\right)-1.$$

Thus, there is a color in $S\left(u\right)$ to color u and a color in $S\left(uv\right)$ to color $uv$ such that the resulting color $\varphi$ obtain from ${\varphi }^{\prime }$ satisfies $m\left(u\right)\ne m^{\prime }\left(z\right)$ for each $z\in N_G\left(u\right)\backslash \{v\}$. Therefore, we can extend ${\varphi }^{\prime }$ to an NSD total L-coloring $\varphi$ of G. It is a contradiction. □

The proofs of the following Claims 4 and 5 are similar to the proof of Claim 2. To avoid duplication, we omit the proofs.

Claim 4.

Let u be a 6-vertex in G. Then, $n_G^3\left(u\right)\le 1$; furthermore, $n_G^{5^{-}}\left(u\right)=1$ when $n_G^3\left(u\right)=1$.

Claim 5.

There is no $(5^{-},5^{-},5^{-})$-cycle in G.

The proof of the following Claim 6 is similar to the proof of Claim 3. To avoid duplication, we omit the proof of Claim 6.

Claim 6.

Let u be an ℓ-vertex of G. Then, each of the following results must hold.

(1) If $\ell =7$, then $n_G^{3^{-}}\left(u\right)\le 1$.

(2) If $\ell =8$, then $n_G^3\left(u\right)\le 3$.

(3) If $8\le \ell \le 9$, then $n_G^{2^{-}}\left(u\right)\le \lceil \frac{\ell }{4}\rceil$; furthermore, $n_G^{3^{-}}\left(u\right)\le \lceil \frac{\ell }{4}\rceil$ when $n_G^{2^{-}}\left(u\right)\ge 1$.

(4) If $10\le \ell \le 13$, then $n_G^{2^{-}}\left(u\right)\le \lfloor \frac{3\ell }{7}\rfloor$; furthermore, $n_G^{3^{-}}\left(u\right)\le \lfloor \frac{3\ell }{7}\rfloor$ when $n_G^{2^{-}}\left(u\right)\ge 1$.

Let $V_i\left(G\right)$($V_{i^{-}}\left(G\right),V_{i^{+}}\left(G\right))$ be the set of vertices in G of degree i (at most i, at least i) and let

$$H=G-V_{2^{-}}\left(G\right).$$

Then, $d_H\left(v\right)=d_G\left(v\right)-n_G^{2^{-}}\left(v\right)$ for each $v\in V\left(H\right)$.

Claim 7.

For the graph H, each of the following results must hold.

(1) $\delta \left(H\right)\ge 3$.

(2) $d_H\left(v\right)=d_G\left(v\right)$ when $3\le d_G\left(v\right)\le 6$.

(3) $d_H\left(v\right)\ge 6$ when $d_G\left(v\right)\ge 7$.

(4) $n_H^3\left(v\right)\le 1$ when $6\le d_H\left(v\right)\le 7$, $n_H^3\left(v\right)=0$ when $d_H\left(v\right)=6$ and $d_G\left(v\right)\ge 7$, $n_H^{5^{-}}\left(v\right)=1$ when $d_H\left(v\right)=6$ and $n_H^3\left(v\right)=1$, and $n_H^3\left(v\right)\le 3$ when $d_H\left(v\right)=8$.

(5) $n_H^{4^{-}}\left(v\right)=0$ when $d_H\left(v\right)\le 5$.

Proof. 

Let v be a vertex of H. Then, $3\le d_G\left(v\right)\le \mathsf{\Delta }\left(G\right)\le 13$ by the definition of H and Claim 1.

(1)–(3) By Claims 3 and 6, we have that

$$\begin{array}{c}\hfill \left\{\begin{array}{cc}{n}_G^{2^{-}}\left(v\right)=0\hfill & \mathrm{if}{d}_G\left(v\right)\le 6;\hfill \\ n_G^{2^{-}}\left(v\right)\le d_G\left(v\right)-6\hfill & \mathrm{if}{d}_G\left(v\right)\in \{7,8,9,10\};\hfill \\ n_G^{2^{-}}\left(v\right)\le d_G\left(v\right)-7\hfill & \mathrm{if}{d}_G\left(v\right)\in \{11,12\};\hfill \\ n_G^{2^{-}}\left(v\right)\le d_G\left(v\right)-8\hfill & \mathrm{if}{d}_G\left(v\right)=13.\hfill \end{array}\right.\end{array}$$

(1)

Thus, $d_H\left(v\right)=d_G\left(v\right)$ when $3\le d_G\left(v\right)\le 6$ and $d_H\left(v\right)\ge 6$ when $d_G\left(v\right)\ge 7$ by Equation (1). Therefore, $\delta \left(H\right)\ge 3$.

(4) By Claims 4 and 6, we have that

$$\begin{array}{c}\hfill \left\{\begin{array}{cc}{n}_G^3\left(v\right)\le 1\hfill & \mathrm{if}{d}_G\left(v\right)=6;\hfill \\ n_G^{3^{-}}\left(v\right)\le 1\hfill & \mathrm{if}{d}_G\left(v\right)=7;\hfill \\ n_G^3\left(v\right)=0\hfill & \mathrm{if}{n}_G^{2^{-}}\left(v\right)=d_G\left(v\right)-6\mathrm{and}{d}_G\left(v\right)\in \{7,8,9,10\};\hfill \\ n_G^3\left(v\right)=0\hfill & \mathrm{if}{n}_G^{2^{-}}\left(v\right)=d_G\left(v\right)-7\mathrm{and}{d}_G\left(v\right)\in \{11,12\};\hfill \\ n_G^3\left(v\right)=0\hfill & \mathrm{if}{n}_G^{2^{-}}\left(v\right)=d_G\left(v\right)-8\mathrm{and}{d}_G\left(v\right)=13.\hfill \end{array}\right.\end{array}$$

(2)

and

$$\begin{array}{c}\hfill \left\{\begin{array}{cc}{n}_G^3\left(v\right)\le 3\hfill & \mathrm{if}{d}_G\left(v\right)=8;\hfill \\ n_G^3\left(v\right)\le 2\hfill & \mathrm{if}{n}_G^{2^{-}}\left(v\right)=d_G\left(v\right)-8\mathrm{and}{d}_G\left(v\right)\in \{9,10\};\hfill \\ n_G^3\left(v\right)\le 1\hfill & \mathrm{if}{n}_G^{2^{-}}\left(v\right)=d_G\left(v\right)-8\mathrm{and}{d}_G\left(v\right)\in \{11,12\};\hfill \\ n_G^3\left(v\right)=0\hfill & \mathrm{if}{n}_G^{2^{-}}\left(v\right)=d_G\left(v\right)-8\mathrm{and}{d}_G\left(v\right)=13.\hfill \end{array}\right.\end{array}$$

(3)

Note that $d_H\left(v\right)=3$ if and only if $d_G\left(v\right)=3$ follows from (2) and (3). Thus, $n_H^3\left(v\right)\le 1$ when $6\le d_H\left(v\right)\le 7$ and $n_H^3\left(v\right)=0$ when $d_H\left(v\right)=6$ and $d_G\left(v\right)\ge 7$ by Equation (2). As $n_H^3\left(v\right)=0$ when $d_H\left(v\right)=6$ and $d_G\left(v\right)\ge 7$, $d_H\left(v\right)=d_G\left(v\right)=6$ when $d_H\left(v\right)=6$ and $n_H^3\left(v\right)=1$. Therefore, $n_H^{5^{-}}\left(v\right)=1$ when $d_H\left(v\right)=6$ and $n_H^3\left(v\right)=1$ by Claim 4. By Equation (3), it is easy to know that $n_H^3\left(v\right)\le 3$ when $d_H\left(v\right)=8$.

(5) Note that $d_H\left(v\right)=d_G\left(v\right)$ when $d_H\left(v\right)\le 5$ by (1)–(3). Thus, $n_H^{4^{-}}\left(v\right)=0$ when $d_H\left(v\right)\le 5$ by Claim 2. □

Claim 8.

Each 3-cycle in H is either a $(3^{+},6^{+},6^{+})$-cycle or a $(5,5,6^{+})$-cycle.

Proof. 

Let v be a vertex of H. Then, $d_H\left(v\right)=d_G\left(v\right)$ when $d_G\left(v\right)\le 5$ and $d_H\left(v\right)\ge 6$ when $d_G\left(v\right)\ge 6$ by Claim 7. Thus, there is no $(5^{-},5^{-},5^{-})$-cycle in H as G contains no $(5^{-},5^{-},5^{-})$-cycle by Claim 5. By Claim 7, we know that each $4^{-}$-vertex is not adjacent to any $5^{-}$-vertex in H. Therefore, each 3-cycle in H is either a $(3^{+},6^{+},6^{+})$-cycle or a $(5,5,6^{+})$-cycle. □

For a planar graph, we call a face a t-face (resp., a $t^{+}$-face, a $t^{-}$-face, an $({\ell }_1,{\ell }_2,{\ell }_3)$-face) if its boundary is a t-cycle (resp., a $t^{+}$-cycle, a $t^{-}$-cycle, an $({\ell }_1,{\ell }_2,{\ell }_3)$-cycle). A face is said to be incident with the vertices and edges in its boundary.

From now on, we assume that the IC-planar graph G has been embedded on a plane such that every edge is crossed by at most one other edge and the number of crossings is as small as possible. We turn all crossings of G into new 4-vertices on the plane and obtain a planar graph $G^{\times }$, which is called the associated planar graph of G. A vertex in $G^{\times }$ is called a false vertex if it is not a vertex of G and real vertex otherwise. We call a face f in $G^{\times }$ a false face if it is incident with one false vertex and a real face otherwise.

Let $H^{\times }$ be the associated planar graph of H. For each real vertex $v\in V\left(H^{\times }\right)$, we use $f\left(v\right)$ and $f^{\prime }\left(v\right)$ to denote the number of real 3-faces and false 3-faces incident with v, respectively.

Claim 9.

Let v be a real vertex of $H^{\times }$. Then, each of the following results must hold.

(1) $f\left(v\right)\le \lfloor \frac{d_{H^{\times }}\left(v\right)}{2}\rfloor$.

(2) $f\left(v\right)\le \lfloor \frac{d_{H^{\times }}\left(v\right)}{2}\rfloor -1$ if v is adjacent to one false 4-vertex and $d_{H^{\times }}\left(v\right)\equiv 0\left(mod2\right)$.

(3) $f\left(v\right)\le \lfloor \frac{d_{H^{\times }}\left(v\right)}{2}\rfloor -1$ if $f^{\prime }\left(v\right)=2$ and $d_{H^{\times }}\left(v\right)\equiv 1\left(mod2\right)$.

(4) $f\left(v\right)\le \lfloor \frac{d_{H^{\times }}\left(v\right)}{2}\rfloor -2$ if $f^{\prime }\left(v\right)=2$ and $d_{H^{\times }}\left(v\right)\equiv 0\left(mod2\right)$.

Proof. 

(1) As G (and thus H) is an IC-planar graph without theta graphs ${\mathsf{\Theta }}_{2,1,2}$, any two real 3-faces have no common edge in H. Thus, a real vertex v of $H^{\times }$ is incident with at most $\lfloor \frac{d_{H^{\times }}\left(v\right)}{2}\rfloor$ real 3-faces as each 3-face contains two edges incident with v. Furthermore, statement (1) holds.

(2) By contradiction, suppose that $f\left(v\right)=\lfloor \frac{d_{H^{\times }}\left(v\right)}{2}\rfloor$. If $d_{H^{\times }}\left(v\right)\equiv 0\left(mod2\right)$, then $\lfloor \frac{d_{H^{\times }}\left(v\right)}{2}\rfloor =\frac{d_{H^{\times }}\left(v\right)}{2}$. Thus, each edge incident with v belongs to a real 3-face incident with v since each 3-face contains two edges. Moreover, v is not adjacent to any false 4-vertex, a contradition. Therefore, $f\left(v\right)\le \lfloor \frac{d_{H^{\times }}\left(v\right)}{2}\rfloor -1$.

(3) and (4) Let v be incident with two false 3-faces. Then, the two false 3-faces contain three edges incident with v since G (and thus H) is an IC-planar graph without theta graphs ${\mathsf{\Theta }}_{2,1,2}$. Thus, the two false 3-faces cause that $f\left(v\right)$ is reduced by 1 when $d_{H^{\times }}\left(v\right)\equiv 1\left(mod2\right)$ and 2 when $d_{H^{\times }}\left(v\right)\equiv 0\left(mod2\right)$. Therefore, (3) and (4) hold. □

The discharging method, first developed in the study of the coloring of planar graphs about 100 years ago, is an important proof technique in graph theory. The method has been applied in many types of problems, especially in various graph coloring problems.

The general process of discharging is that members (usually vertices or vertices and faces) of a graph are assigned charges by certain “charging rules”, then the graph is discharged by certain “discharging rules”, during which some members get charges, and some members lose charges, while the sum of the charges keeps unchanged.

In the following, we will apply the discharging method on the associated planar graph $H^{\times }$ to show that $H^{\times }$ (and thus H) does not exist. Therefore, G does not exist.

Let $F\left(H^{\times }\right)$ denote the set of faces in $H^{\times }$. For each $z\in V\left(H^{\times }\right)\cup F\left(H^{\times }\right)$, assign the initial charge $\omega \left(z\right)=d_{H^{\times }}\left(z\right)-4$. By Euler’s formula, we have

$$\sum _{z\in V\left(H^{\times }\right)\cup F\left(H^{\times }\right)}\omega \left(z\right)=-8.$$

Next, we make some discharging rules to redistribute charges among vertices and faces and keep the total charges unchanged. For simplicity, a real ℓ-vertex is still called an ℓ-vertex in the following discussion.

The discharging rules as follows:

(R1) 

Each 3-vertex receives $\frac{1}{3}$ from each neighbor.

(R2) 

Let z be a false 4-vertex and x be one neighbor of z in $H^{\times }$.

(R2.1) 

When $d_{H^{\times }}\left(x\right)=5$, z receives $\frac{1}{2}$ from x.

(R2.2) 

When $\left(d_{H^{\times }}\left(x\right),n_{H^{\times }}^3\left(x\right)\right)=(6,0)$, z receives 1 from x.

(R2.3) 

When $\left(d_{H^{\times }}\left(x\right),n_{H^{\times }}^3\left(x\right)\right)=(6,1)$, z receives $\frac{7}{6}$ from x if $f^{\prime }\left(x\right)=2$ and $\frac{2}{3}$ from x otherwise.

(R2.4) 

When $d_{H^{\times }}\left(x\right)=7$, z receives $\frac{5}{3}$ from x if $f^{\prime }\left(x\right)=2$ and $\frac{7}{6}$ from x otherwise.

(R2.5) 

When $d_{H^{\times }}\left(x\right)\ge 8$, z receives $\frac{5}{3}$ from x if $f^{\prime }\left(x\right)=2$ and $\frac{4}{3}$ from x otherwise.

(R3) 

Each false 3-face receives 1 from the false 4-vertex incident with it.

(R4) 

Each real 3-face receives $\frac{1}{4}$ from each 5-vertex incident with it and $\frac{1}{2}$ from $6^{+}$-vertex incident with it.

In the following, we give a specific example about the charge change of some false 4-vertex by the discharging rules. Let u be a false 4-vertex in $H^{\times }$ and $N_{H^{\times }}\left(u\right)=\{v_1,v_2,v_3,v_4\}$ with $d_{H^{\times }}\left(v_1\right)=3,d_{H^{\times }}\left(v_2\right)=6,d_{H^{\times }}\left(v_3\right)=7$ and $d_{H^{\times }}\left(v_4\right)\ge 8$. We take the configuration of $H^{\times }[\{u\}\cup N_{H^{\times }}\left(u\right)]$ (see Figure 1) as a specific example to illustrate how the charge of the false 4-vertex u changes by the discharging rules.

Figure 1. A specific example about the charge change of the false 4-vertex u.

Next, we discuss the new charge of each $z\in V\left(H^{\times }\right)\cup F\left(H^{\times }\right)$ after the discharging process. Let ${\omega }^{\prime }\left(z\right)$ denote the new charge for each $z\in V\left(H^{\times }\right)\cup F\left(H^{\times }\right)$. Then,

$$\sum _{z\in V\left(H^{\times }\right)\cup F\left(H^{\times }\right)}{\omega }^{\prime }\left(z\right)=\sum _{z\in V\left(H^{\times }\right)\cup F\left(H^{\times }\right)}\omega \left(z\right)=-8<0.$$

In the following, we show ${\omega }^{\prime }\left(z\right)\ge 0$ for each $z\in V\left(H^{\times }\right)\cup F\left(H^{\times }\right)$ to obtain a contradiction.

First, we prove ${\omega }^{\prime }\left(z\right)\ge 0$ for each (real or false) face $z\in F\left(H^{\times }\right)$. Pick arbitrarily a face z from $F\left(H^{\times }\right)$. If z is a false 3-face, then it must be incident with a false 4-vertex. Therefore, ${\omega }^{\prime }\left(z\right)=3-4+1=0$ by (R3). If z is a real 3-face, then it is easy to verify ${\omega }^{\prime }\left(z\right)\ge 0$ by (R4) since each real 3-face is either a $(3^{+},6^{+},6^{+})$-face or a $(5,5,6^{+})$-face by Claim 8. If z is a (real or false) $4^{+}$-face, then ${\omega }^{\prime }\left(z\right)=\omega \left(z\right)=d_{H^{\times }}\left(z\right)-4\ge 0$ as no rule is applied to it. Thus, ${\omega }^{\prime }\left(z\right)\ge 0$ for each $z\in F\left(H^{\times }\right)$.

Note that $V\left(H^{\times }\right)$ consists of all real vertices in $V\left(H\right)$ and all false 4-vertices.

Second, we show ${\omega }^{\prime }\left(z\right)\ge 0$ for each real vertex $z\in V\left(H\right)$. Choose arbitrarily a vertex z from $V\left(H\right)$. Since $\delta \left(H\right)\ge 3$, $\delta \left(H^{\times }\right)\ge 3$. Note that each real vertex z gives no charge to any false 3-face and $d_{H^{\times }}\left(z\right)=d_H\left(z\right)$. If z is a 3-vertex, then ${\omega }^{\prime }\left(z\right)=3-4+3·\frac{1}{3}=0$ by (R1). If z is a 4-vertex, then ${\omega }^{\prime }\left(z\right)=\omega \left(z\right)=4-4=0$ as each 4-vertex gives nothing away. In the following, we discuss $z\in V_{5^{+}}\left(H\right).$

Note that as H is an IC-planar graph, each real vertex z is adjacent to at most a false 4-vertex and $0\le f^{\prime }\left(z\right)\le 2$.

Let $d_{H^{\times }}\left(z\right)=5$. Then, $f\left(z\right)\le 2$ by Claim 9. Thus, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(2·\frac{1}{4}+\frac{1}{2})=0$ by (R2) and (R4) as z is not adjacent to any 3-vertex by Claim 7.

Let $d_{H^{\times }}\left(z\right)=6$. Then, $n_{H^{\times }}^3\left(z\right)\le n_H^3\left(z\right)\le 1$ by Claim 7. If z is not adjacent to any false 4-vertex, then $f\left(z\right)\le 3$ by Claim 9. Thus, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(3·\frac{1}{2}+\frac{1}{3})=\frac{1}{6}$ by (R1) and (R4). If z is adjacent to one false 4-vertex and $f^{\prime }\left(z\right)\le 1$, then $f\left(z\right)\le 2$ by Claim 9. When z is not adjacent to any 3-vertex in $H^{\times }$, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(2·\frac{1}{2}+1)=0$ by (R2) and (R4). When z is adjacent to a 3-vertex in $H^{\times }$, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(2·\frac{1}{2}+\frac{2}{3}+\frac{1}{3})=0$ by (R1), (R2), and (R4). If z is adjacent to one false 4-vertex and $f^{\prime }\left(z\right)=2$, then $f\left(z\right)\le 1$ by Claim 9. When z is not adjacent to any 3-vertex in $H^{\times }$, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(\frac{1}{2}+1)=\frac{1}{2}$ by (R2) and (R4). When z is adjacent to a 3-vertex in $H^{\times }$, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(\frac{1}{2}+\frac{7}{6}+\frac{1}{3})=0$ by (R1), (R2), and (R4).

Let $d_{H^{\times }}\left(z\right)=7$. Then, $n_{H^{\times }}^3\left(z\right)\le n_H^3\left(z\right)\le 1$ by Claim 7. If $f^{\prime }\left(z\right)\le 1$, then $f\left(z\right)\le 3$ by Claim 9. Thus, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(3·\frac{1}{2}+\frac{7}{6}+\frac{1}{3})=0$ by (R1), (R2), and (R4). If $f^{\prime }\left(z\right)=2$, then $f\left(z\right)\le 2$ by Claim 9. Thus, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(2·\frac{1}{2}+\frac{5}{3}+\frac{1}{3})=0$ by (R1), (R2), and (R4).

Let $d_{H^{\times }}\left(z\right)=8$. Then, $n_{H^{\times }}^3\left(z\right)\le n_H^3\left(z\right)\le 3$ by Claim 7. If z is not adjacent to any false 4-vertex, then $f\left(z\right)\le 4$ by Claim 9. Thus, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(3·\frac{1}{3}+4·\frac{1}{2})=1$ by (R1) and (R4). If z is adjacent to one false 4-vertex and $f^{\prime }\left(z\right)\le 1$, then $f\left(z\right)\le 3$ by Claim 9. Thus, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(\frac{4}{3}+3·\frac{1}{3}+3·\frac{1}{2})=\frac{1}{6}$ by (R1), (R2), and (R4). If z is adjacent to one false 4-vertex and $f^{\prime }\left(z\right)=2$, then $f\left(z\right)\le 2$ by Claim 9. Thus, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-(\frac{5}{3}+3·\frac{1}{3}+2·\frac{1}{2})=\frac{1}{3}$ by (R1), (R2), and (R4).

Let $d_{H^{\times }}\left(z\right)=\ell$$(9\le \ell \le 13)$. Note that each (real or false) 3-face is incident with at most one 3-vertex as two 3-vertices are not adjacent in H (and thus $H^{\times }$) by Claim 7. If $f^{\prime }\left(z\right)\le 1$, then $f\left(z\right)\le \lfloor \frac{\ell }{2}\rfloor$ and $n_{H^{\times }}^3\left(z\right)+f\left(z\right)\le \ell$ by Claim 9. Thus, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-\left(\frac{4}{3}+max\{\frac{1}{3}·n_{H^{\times }}^3\left(z\right)+\frac{1}{2}·f\left(z\right)|f\left(z\right)\le \lfloor \frac{\ell }{2}\rfloor \mathrm{and}{n}_{H^{\times }}^3\left(z\right)+f\left(z\right)\le \ell \}\right)$ by (R1), (R2), and (R4). Therefore, ${\omega }^{\prime }\left(z\right)\ge 0$ when $\ell =9$ and ${\omega }^{\prime }\left(z\right)\ge \frac{1}{2}$ when $10\le \ell \le 13.$ If $f^{\prime }\left(z\right)=2$, then $f\left(z\right)\le \lfloor \frac{\ell }{2}\rfloor -1$ and $n_{H^{\times }}^3\left(z\right)+f\left(z\right)\le \ell -1$ by Claim 9. Thus, ${\omega }^{\prime }\left(z\right)\ge d_{H^{\times }}\left(z\right)-4-\left(\frac{5}{3}+max\{\frac{1}{3}·n_{H^{\times }}^3\left(z\right)+\frac{1}{2}·f\left(z\right)|f\left(z\right)\le \lfloor \frac{\ell }{2}\rfloor -1\mathrm{and}{n}_{H^{\times }}^3\left(z\right)+f\left(z\right)\le \ell -1\}\right)\ge \frac{1}{12}$ by (R1), (R2), and (R4).

Therefore, ${\omega }^{\prime }\left(z\right)\ge 0$ for each real vertex $z\in V\left(H\right)$.

Finally, we prove ${\omega }^{\prime }\left(z\right)\ge 0$ for each false 4-vertex $z\in V\left(H^{\times }\right)\backslash V\left(H\right)$. Pick arbitrarily a vertex z from $V\left(H^{\times }\right)\backslash V\left(H\right)$. Let $N_{H^{\times }}\left(z\right)=\{v_1,v_2,v_3,v_4\}$. Then, up to isomorphism, the induced subgraph $H^{\times }[\{z\}\cup N_{H^{\times }}\left(z\right)]$ is one of four configurations in Figure 2.

Figure 2. Four different configurations of $H^{\times }[\{z\}\cup N_{H^{\times }}\left(z\right)]$.

Note that z is incident with at most two false 3-faces as H is an IC-planar graph without theta graphs ${\mathsf{\Theta }}_{2,1,2}$. By Claim 7, z is adjacent to at most two ℓ-vertices with $3\le \ell \le 4$ in $H^{\times }$.

$⟨1⟩$ Suppose that the configuration of $H^{\times }[\{z\}\cup N_{H^{\times }}\left(z\right)]$ is $F_1$ in Figure 2. As z is not incident with any false 3-face and adjacent to at most two 3-vertices, it is easy to verify ${\omega }^{\prime }\left(z\right)\ge 0$ by (R1) and (R2).

$⟨2⟩$ Suppose that the configuration of $H^{\times }[\{z\}\cup N_{H^{\times }}\left(z\right)]$ is $F_2$ in Figure 2. Then, z is incident with one false 3-face.

$⟨2.1⟩$ Assume that z is not adjacent to any 3-vertex. Then, it is adjacent to at least two $5^{+}$-vertices by Claim 7. Thus, ${\omega }^{\prime }\left(z\right)\ge 4+2·\frac{1}{2}-4-1=0$ by (R2) and (R3).

$⟨2.2⟩$ Assume that z is adjacent to exactly one 3-vertex. Then, it is adjacent to at most one 4-vertex by Claim 7. If z is not adjacent to any 4-vertex, then it is adjacent to two $5^{+}$-vertices and one $6^{+}$-vertex by Claim 7. Thus, ${\omega }^{\prime }\left(z\right)\ge 4-4+2·\frac{1}{2}+\frac{2}{3}-\frac{1}{3}-1=\frac{1}{3}$ by (R1)∼(R3). If z is adjacent to exactly one 4-vertex, then it is adjacent to two $6^{+}$-vertices by Claim 7. Thus, ${\omega }^{\prime }\left(z\right)\ge 4-4+2·\frac{2}{3}-\frac{1}{3}-1=0$ by (R1)∼(R3).

$⟨2.3⟩$ Assume that z is adjacent to two 3-vertices. Then, z is adjacent to two $6^{+}$-vertices. If z is adjacent to two 6-vertices, then ${\omega }^{\prime }\left(z\right)\ge 4-4+2·1-2·\frac{1}{3}-1=\frac{1}{3}$ by (R1)∼(R3) as each 6-vertex is not adjacent to any 3-vertex in $H^{\times }$ by Claim 7. If it is adjacent to one $6^{+}$-vertex and one $7^{+}$-vertex, then ${\omega }^{\prime }\left(z\right)\ge 4-4+\frac{2}{3}+\frac{7}{6}-2·\frac{1}{3}-1=\frac{1}{6}$ by (R1)∼(R3).

$⟨3⟩$ Suppose that the configuration of $H^{\times }[\{z\}\cup N_{H^{\times }}\left(z\right)]$ is $F_3$ in Figure 2. Then, z is incident with two false 3-faces.

$⟨3.1⟩$ Assume that z is not adjacent to any 3-vertex. Then z is adjacent to at most two 4-vertices by Claim 7.

$⟨3.1.1⟩$ Let z be not adjacent to any 4-vertex. Then, it is adjacent to four $5^{+}$-vertices by Claim 7. Thus, ${\omega }^{\prime }\left(z\right)\ge 4+4·\frac{1}{2}-4-2=0$ by (R2) and (R3).

$⟨3.1.2⟩$ Let z be adjacent to exactly one 4-vertex. Then, it is adjacent to one $5^{+}$-vertices and two $6^{+}$-vertices by Claim 7. Without loss of generosity, suppose that $d_{H^{\times }}\left(v_1\right)=4$. Then, $d_{H^{\times }}\left(v_i\right)\ge 6$$(i=2,3)$. If $d_{H^{\times }}\left(v_2\right)=6$, then $v_2$ is not adjacent to any 3-vertex in H (and thus $H^{\times }$) by Claim 7 as it is adjacent to one 4-vertex in H. Thus, ${\omega }^{\prime }\left(z\right)\ge 4+\frac{1}{2}+\frac{2}{3}+1-4-2=\frac{1}{6}$ by (R2) and (R3). If $d_{H^{\times }}\left(v_2\right)\ge 7$, then ${\omega }^{\prime }\left(z\right)\ge 4+\frac{1}{2}+\frac{2}{3}+\frac{7}{6}-4-2=\frac{1}{3}$ by (R2) and (R3).

$⟨3.1.3⟩$ Let z be adjacent to two 4-vertices. As two 4-vertices are not adjacent in H (and thus $H^{\times }$) by Claim 7, without loss of generosity, suppose that $d_{H^{\times }}\left(v_i\right)=4$$(i=1,4)$. Then, $d_{H^{\times }}\left(v_i\right)\ge 6$$(i=2,3)$ by Claim 7. Note that if $d_{H^{\times }}\left(v_i\right)=6$$(i=2,3)$, then $v_i$ is not adjacent to any 3-vertex in H (and thus $H^{\times }$) by Claim 7 as it is adjacent to one 4-vertex in H. If $d_{H^{\times }}\left(v_2\right)=d_{H^{\times }}\left(v_3\right)=6$, then ${\omega }^{\prime }\left(z\right)\ge 4+2·1-4-2=0$ by (R2) and (R3). If $d_{H^{\times }}\left(v_2\right)=6$ and $d_{H^{\times }}\left(v_3\right)\ge 7$, then ${\omega }^{\prime }\left(z\right)\ge 4+1+\frac{7}{6}-4-2=\frac{1}{6}$ by (R2) and (R3). If $d_{H^{\times }}\left(v_2\right)\ge 7$ and $d_{H^{\times }}\left(v_3\right)=6$, then ${\omega }^{\prime }\left(z\right)\ge 4+\frac{7}{6}+1-4-2=\frac{1}{6}$ by (R2) and (R3). If $d_{H^{\times }}\left(v_2\right)\ge 7$ and $d_{H^{\times }}\left(v_3\right)\ge 7$, then ${\omega }^{\prime }\left(z\right)\ge 4+2·\frac{7}{6}-4-2=\frac{1}{3}$ by (R2) and (R3).

$⟨3.2⟩$ Assume that z is adjacent to exactly one 3-vertex. Without loss of generosity, suppose that $d_{H^{\times }}\left(v_1\right)=3$. Then $d_{H^{\times }}\left(v_i\right)\ge 6$$(i=2,3)$ by Claim 7.

$⟨3.2.1⟩$ Let $d_{H^{\times }}\left(v_3\right)=6$. As $v_3$ is adjacent to a 3-vertex $v_1$ in H, it is not adjacent to any other $5^{-}$-vertex except $v_1$ in H by Claim 7. Thus, $d_{H^{\times }}\left(v_4\right)\ge 6$ and $n_{H^{\times }}^3\left(v_3\right)=0$. Therefore, ${\omega }^{\prime }\left(z\right)\ge 4-4+2·\frac{2}{3}+1-\frac{1}{3}-2=0$ by (R1)∼(R3).

$⟨3.2.2⟩$ Let $d_{H^{\times }}\left(v_3\right)\ge 7$. If $d_{H^{\times }}\left(v_2\right)=6$, then it is not adjacent to any other $5^{-}$-vertex except $v_1$ in H as $v_2$ is adjacent to a 3-vertex $v_1$ in H by Claim 7. Thus, $d_{H^{\times }}\left(v_4\right)\ge 6$. Therefore, ${\omega }^{\prime }\left(z\right)\ge 4-4+2·\frac{2}{3}+\frac{7}{6}-\frac{1}{3}-2=\frac{1}{6}$ by (R1)∼(R3). If $d_{H^{\times }}\left(v_2\right)\ge 7$, then ${\omega }^{\prime }\left(z\right)\ge 4-4+2·\frac{7}{6}-\frac{1}{3}-2=0$ by (R1)∼(R3).

$⟨3.3⟩$ Assume that z is adjacent to two 3-vertices. Then, z is adjacent to two $8^{+}$-vertices by Claim 7. Thus, ${\omega }^{\prime }\left(u\right)\ge 4-4+2·\frac{4}{3}-2·\frac{1}{3}-2=0$ by (R1)∼(R3).

$⟨4⟩$ Suppose that the configuration of $H^{\times }[\{z\}\cup N_{H^{\times }}\left(z\right)]$ is $F_4$ in Figure 2. Then, z is incident with two false 3-faces. Note that $v_2$ is also incident with two false 3-faces.

$⟨4.1⟩$ Assume that z is not adjacent to any 3-vertex. Then, z is adjacent to at most two 4-vertices by Claim 7.

$⟨4.1.1⟩$ Let z be not adjacent to any 4-vertex. Then, it is adjacent to four $5^{+}$-vertices by Claim 7. Thus, ${\omega }^{\prime }\left(z\right)\ge 4+4·\frac{1}{2}-4-2=0$ by (R2) and (R3).

$⟨4.1.2⟩$ Let z be adjacent to exactly one 4-vertex.

$⟨4.1.2a⟩$ Let $d_{H^{\times }}\left(v_1\right)=4$. Then, $d_{H^{\times }}\left(v_i\right)\ge 6$$(i=2,3)$ by Claim 7. If $d_{H^{\times }}\left(v_2\right)=6$, then $v_2$ is not adjacent to any 3-vertex in H (and thus $H^{\times }$) by Claim 7 as it is adjacent to one 4-vertex $v_1$ in H. Note that $d_{H^{\times }}\left(v_4\right)\ge 5$. Thus, ${\omega }^{\prime }\left(z\right)\ge 4+\frac{1}{2}+\frac{2}{3}+1-4-2=\frac{1}{6}$ by (R2) and (R3). If $d_{H^{\times }}\left(v_2\right)\ge 7$, ${\omega }^{\prime }\left(z\right)\ge 4+\frac{1}{2}+\frac{2}{3}+\frac{7}{6}-4-2=\frac{1}{3}$ by (R2) and (R3).

By symmetry, we know that ${\omega }^{\prime }\left(z\right)\ge 0$ when $d_{H^{\times }}\left(v_3\right)=4$.

$⟨4.1.2b⟩$ Let $d_{H^{\times }}\left(v_2\right)=4$. Then, $d_{H^{\times }}\left(v_i\right)\ge 6$$(i=2,3,4)$ by Claim 7. Thus, ${\omega }^{\prime }\left(z\right)\ge 4+3·\frac{2}{3}-4-2=0$ by (R2) and (R3).

$⟨4.1.2c⟩$ Let $d_{H^{\times }}\left(v_4\right)=4$. Then $d_{H^{\times }}\left(v_2\right)\ge 6$ by Claim 7. Note that $d_{H^{\times }}\left(v_i\right)\ge 5$$(i=1,3)$. If $d_{H^{\times }}\left(v_2\right)=6$, then $v_2$ is not adjacent to any 3-vertex in H (and thus $H^{\times }$) by Claim 7 as it is adjacent to one 4-vertex $v_4$ in H. Thus, ${\omega }^{\prime }\left(z\right)\ge 4+2·\frac{1}{2}+1-4-2=0$ by (R2) and (R3). If $d_{H^{\times }}\left(v_2\right)\ge 7$, ${\omega }^{\prime }\left(z\right)\ge 4+2·\frac{1}{2}+\frac{7}{6}-4-2=\frac{1}{6}$ by (R2) and (R3).

$⟨4.1.3⟩$ Let z be adjacent to two 4-vertices. As two 4-vertices are not adjacent in H by Claim 7, $d_{H^{\times }}\left(v_4\right)=4$. Then, $d_{H^{\times }}\left(v_2\right)\ge 6$ by Claim 7. Without loss of generosity, suppose that $d_{H^{\times }}\left(v_1\right)=4$. Then, $d_{H^{\times }}\left(v_3\right)\ge 6$ by Claim 7. Note that if $d_{H^{\times }}\left(v_i\right)=6$$(i=2,3)$, then $v_i$ is not adjacent to any 3-vertex in H (and thus $H^{\times }$) by Claim 7 as it is adjacent to one 4-vertex in H. If $d_{H^{\times }}\left(v_2\right)=d_{H^{\times }}\left(v_3\right)=6$, then ${\omega }^{\prime }\left(z\right)\ge 4+2·1-4-2=0$ by (R2) and (R3). If $d_{H^{\times }}\left(v_2\right)=6$ and $d_{H^{\times }}\left(v_3\right)\ge 7$, then ${\omega }^{\prime }\left(z\right)\ge 4+1+\frac{7}{6}-4-2=\frac{1}{6}$ by (R2) and (R3). If $d_{H^{\times }}\left(v_2\right)\ge 7$ and $d_{H^{\times }}\left(v_3\right)=6$, then ${\omega }^{\prime }\left(z\right)\ge 4+\frac{7}{6}+1-4-2=\frac{1}{6}$ by (R2) and (R3). If $d_{H^{\times }}\left(v_2\right)\ge 7$ and $d_{H^{\times }}\left(v_3\right)\ge 7$, then ${\omega }^{\prime }\left(z\right)\ge 4+2·\frac{7}{6}-4-2=\frac{1}{3}$ by (R2) and (R3).

$⟨4.2⟩$ Assume that z is adjacent to exactly one 3-vertex.

$⟨4.2.1⟩$ Let $d_{H^{\times }}\left(v_1\right)=3$. Then, $d_{H^{\times }}\left(v_i\right)\ge 6$$(i=2,3)$ by Claim 7.

$⟨4.2.1a⟩$ Suppose that $d_{H^{\times }}\left(v_2\right)=6$. As $v_2$ is adjacent to a 3-vertex $v_1$ in H, it is not adjacent to any other $5^{-}$-vertex except $v_1$ in H by Claim 7. Thus, $d_{H^{\times }}\left(v_4\right)=d_H\left(v_4\right)\ge 6$. As $d_{H^{\times }}\left(v_3\right)\ge 6$ and $f^{\prime }\left(v_2\right)=2$, ${\omega }^{\prime }\left(z\right)\ge 4-4+\frac{7}{6}+2·\frac{2}{3}-\frac{1}{3}-2=\frac{1}{6}$ by (R1)∼(R3).

$⟨4.2.1b⟩$ Suppose that $d_{H^{\times }}\left(v_2\right)\ge 7$. As $d_{H^{\times }}\left(v_3\right)\ge 6$ and $f^{\prime }\left(v_2\right)=2$, Thus, ${\omega }^{\prime }\left(z\right)\ge 4-4+\frac{2}{3}+\frac{5}{3}-\frac{1}{3}-2=0$ by (R1)∼(R3)

By symmetry, we know that ${\omega }^{\prime }\left(z\right)\ge 0$ when $d_{H^{\times }}\left(v_3\right)=3$.

$⟨4.2.2⟩$ Let $d_{H^{\times }}\left(v_2\right)=3$. Then, $d_{H^{\times }}\left(v_i\right)\ge 6$$(i=1,3,4)$ by Claim 7. If $d_{H^{\times }}\left(v_4\right)=6$, then $v_4$ is not adjacent to any other 3-vertex in H (and thus $H^{\times }$) by Claim 7 as it is adjacent to a 3-vertex $v_2$ in H. Thus, ${\omega }^{\prime }\left(z\right)\ge 4-4+2·\frac{2}{3}+1-\frac{1}{3}-2=0$ by (R1)∼(R3). If $d_{H^{\times }}\left(v_4\right)\ge 7$, then ${\omega }^{\prime }\left(z\right)\ge 4-4+2·\frac{2}{3}+\frac{7}{6}-\frac{1}{3}-2=\frac{1}{6}$ by (R1)∼(R3).

$⟨4.2.3⟩$ Let $d_{H^{\times }}\left(v_4\right)=3$. Then, $d_{H^{\times }}\left(v_2\right)\ge 6$ by Claim 7.

$⟨4.2.3a⟩$ Suppose that $d_{H^{\times }}\left(v_2\right)=6$. Since $v_2$ is adjacent to a 3-vertex $v_4$ in H, it is not adjacent to any other $5^{-}$-vertex in H by Claim 7. Thus, $d_{H^{\times }}\left(v_i\right)=d_H\left(v_i\right)\ge 6$$(i=1,3)$ by Claim 7. Thus, ${\omega }^{\prime }\left(z\right)\ge 4-4+2·\frac{2}{3}+1-\frac{1}{3}-2=0$ by (R1)∼(R3).

$⟨4.2.3b⟩$ Suppose that $d_{H^{\times }}\left(v_2\right)\ge 7$. Note that $d_{H^{\times }}\left(v_i\right)\ge 4$$(i=1,3)$. If $d_{H^{\times }}\left(v_1\right)=4$, then $d_{H^{\times }}\left(v_3\right)\ge 6$ by Claim 7. Thus, ${\omega }^{\prime }\left(z\right)\ge 4-4+\frac{5}{3}+\frac{2}{3}-\frac{1}{3}-2=0$ by (R1)∼(R3) since $f^{\prime }\left(v_2\right)=2$. If $d_{H^{\times }}\left(v_1\right)\ge 5$, then $d_{H^{\times }}\left(v_3\right)\ge 5$ by Claim 7. Thus, ${\omega }^{\prime }\left(z\right)\ge 4-4+\frac{5}{3}+2·\frac{1}{2}-\frac{1}{3}-2=\frac{1}{3}$ by (R1)∼(R3) as $f^{\prime }\left(v_2\right)=2$.

$⟨4.3⟩$ Assume that z is adjacent to two 3-vertices. Then, $d_{H^{\times }}\left(v_4\right)=3$ as two 3-vertices are not adjacent in H (and thus $H^{\times }$) by Claim 7. Thus, $d_{H^{\times }}\left(v_2\right)\ge 8$. For $v_1$ and $v_3$, without loss of generosity, suppose that $d_{H^{\times }}\left(v_1\right)=3$. Then, $d_{H^{\times }}\left(v_3\right)\ge 6$. If $d_{H^{\times }}\left(v_3\right)=6$, then $v_3$ is not adjacent to any 3-vertex in $H^{\times }$ as it is adjacent to one 3-vertex $v_1$ in H. Thus, ${\omega }^{\prime }\left(z\right)\ge 4-4+\frac{5}{3}+1-2·\frac{1}{3}-2=0$ by (R1)∼(R3) as $f^{\prime }\left(v_2\right)=2$. If $d_{H^{\times }}\left(v_3\right)\ge 7$, ${\omega }^{\prime }\left(z\right)\ge 4-4+\frac{5}{3}+\frac{7}{6}-2·\frac{1}{3}-2=\frac{1}{6}$ by (R1)∼(R3) as $f^{\prime }\left(v_2\right)=2$.

Therefore, ${\omega }^{\prime }\left(z\right)\ge 0$ for each false 4-vertex $z\in V\left(H^{\times }\right)\backslash V\left(H\right)$.

In summary, ${\omega }^{\prime }\left(z\right)\ge 0$ for each $z\in V\left(H^{\times }\right)\cup F\left(H^{\times }\right)$, which contradicts ${\sum }_{z\in V\left(H^{\times }\right)\cup F\left(H^{\times }\right)}{\omega }^{\prime }\left(z\right)=-8<0$. The proof of Theorem 3 is completed.