Next Article in Journal
Dynamics and Bifurcation Analysis of a Generalized Three-Dimensional Chaotic Financial System
Next Article in Special Issue
On Subdivision of Cycles with Two Blocks in Chromatic Digraphs Spanned by Hamiltonian Directed Paths
Previous Article in Journal
Lyapunov-Based Event-Triggered Fault-Tolerant Distributed Control for DC Microgrids with Communication Failures
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Planar Graphs with Sparse Triangles and Without 4-Cycles and 5-Cycles Admit (F2, F7)-Partition

School of Mathematics and Statistics, Wuhan University of Technology, Wuhan 430070, China
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(7), 1153; https://doi.org/10.3390/math14071153
Submission received: 11 March 2026 / Revised: 26 March 2026 / Accepted: 28 March 2026 / Published: 30 March 2026
(This article belongs to the Special Issue Advances in Graph Theory and Graph Coloring)

Abstract

If the vertex set of a graph G can be partitioned into k subsets V 1 , V 2 , , V k , and the induced subgraph on each subset V i is a forest whose maximum degree is at most d i ( i = 1 , , k ), then this partition is called an ( F d 1 , , F d k ) -partition of G. Cho et al. (2021) conjectured that every planar graph without 4-cycles and 5-cycles admits an ( F 2 , F d ) -partition, where d is a positive integer. In this paper, we prove that every planar graph with sparse triangles and without 4-cycles and 5-cycles admits ( F 2 , F 7 ) -partition. This result provides further support for the above conjecture.
MSC:
05C10; 05C15; 05C70

1. Introduction

All graphs considered in this paper are simple. In vertex coloring, if adjacent vertices are allowed to receive the same color, the coloring is called a defective coloring. Let F d and Δ d denote the classes of forests and graphs with maximum degree at most d, respectively, and denote F 0 by I . For i { 1 , , k } , let G i be a family of graphs. If the vertex set of a graph G can be partitioned into k subsets V 1 , V 2 , , V k such that the subgraph induced by V i belongs to G i , then this partition is called a ( G 1 , , G k ) -coloring or a ( G 1 , , G k ) -partition of G. The well-known Four-Color Theorem can be restated as follows: every planar graph admits an ( I , I , I , I ) -partition.
Coloring problems of planar graphs have been extensively studied. In 1986, Cowen et al. [1] proved that every planar graph is ( Δ 2 , Δ 2 , Δ 2 ) -colorable. Grötzsch [2] showed that every triangle-free planar graph admits an ( I , I , I ) -partition. Stenberg [3] conjectured that every planar graph without 4-cycles and 5-cycles admits an ( I , I , I ) -partition. Although this conjecture was disproved by Cohen-Addad et al. [4], the related coloring problems have continued to attract considerable attention. For example, Chen et al. [5] proved that such graphs admit a ( Δ 2 , I , I ) -partition. However, whether they admit a ( Δ 1 , I , I ) -partition remains an open problem.
Since the 3-coloring problem for this class of graphs is difficult, researchers have investigated their 2-colorings. Sittitrai and Nakprasit [6] proved that, for any positive integer k, these graphs do not admit a ( Δ 1 , Δ k ) -coloring, but they admit ( Δ 4 , Δ 4 ) -, ( Δ 3 , Δ 5 ) -, and ( Δ 2 , Δ 9 ) -colorings. Liu and Lv [7] later improved the last result and proved that these graphs are ( Δ 2 , Δ 6 ) -colorable. Recently, Li et al. [8] proved that these graphs are ( Δ 3 , Δ 3 ) -colorable.
For forest partitions, Choi et al. [9] proved that such graphs admit an ( F 3 , F 4 ) -partition and proposed the following conjecture.
Problem 1.
Every planar graph without 4-cycles and 5-cycles admits an ( F 2 , F d ) -partition, where d is a positive integer.
In 2024, Tangjai et al. [10] advanced this line of research. They proved that every planar graph without 4- and 5-cycles admits an ( S 3 , F ) -partition, where S 3 is a disjoint union of paths and K 1 , 3 , which is closer to F 2 than previous results. However, the maximum degree has not yet been reduced to 2. Due to the difficulty of the forest partition problem for planar graphs without 4- and 5-cycles, many researchers have turned to studying the forest partition problem for planar graphs without 4- and 6-cycles. Wang et al. [11] proved that every planar graph without 4- and 6-cycles admits an ( F 5 , F 5 ) -partition. Hu et al. [12] improved this result by showing that such graphs admit an ( F 3 , F 4 ) -partition. Meanwhile, Huang et al. [13] proved that these graphs also admit an ( F 2 , F 6 ) -partition.
Since planar graphs without 4- and 6-cycles already admit an ( F 2 , F 6 ) -partition, this paper focuses on addressing Problem 1. For planar graphs without 4- and 5-cycles, the discussion becomes very complicated when a vertex is adjacent to multiple triangles. In this paper, by imposing a sparsity condition on triangles, we improve Problem 1 to F 2 . Triangle sparsity means that each vertex is adjacent to at most one triangle, that is, any two triangles are vertex-disjoint. As a consequence, we obtain the following result.
Theorem 1.
Every planar graph without 4-cycles and 5-cycles in which any two triangles are vertex-disjoint admits an ( F 2 , F 7 ) -partition.
Next, we introduce several notions used in the paper. Let v be a vertex in G. The number of neighbors of v is called the degree of v, denoted by d ( v ) . If d ( v ) = k (or ≥k, ≤k), then v is called a k-vertex (or k + -vertex, k -vertex). Similarly, define a k-face (or k + -face, k -face). Let f = [ v 1 , , v k ] be a k-face. If d ( v i ) = d i for i = 1 , , k , then f is called a ( d 1 , , d k ) -face.
If a 2-vertex incident with a 3-face, then the 2-vertex is called a bad 2-vertex; otherwise it is called a good 2-vertex. Let v be a vertex in G, u be a neighbor of v, and f be a 3-face incident with u such that v is not incident with f. Then v is called an external neighbor of u (with respect to f). If u is a 3-vertex, then f is called a pendant face of v, and u is called a pendant vertex of v. Let N 2 ( v ) = { u u is a good 2 -neighbor of v } , N p 3 ( v ) = { u u is a pendant vertex of v and u is incident with a ( 3 , 8 , 8 ) -face } . Denote by n 2 ( v ) and n p 3 ( v ) the numbers of vertices in N 2 ( v ) and N p 3 ( v ) , respectively; that is, n 2 ( v ) = | N 2 ( v ) | and n p 3 ( v ) = | N p 3 ( v ) | .
A k-vertex adjacent to a 9 + -vertex is called a rich k-vertex; otherwise it is called a poor k-vertex. If a 3-face f is not adjacent to any rich 5-vertex but is adjacent to a 3-vertex u whose external neighbor is also a 3-vertex, then f is called a special 3-face. If a poor 5-vertex v is adjacent to a 3-face and n 2 ( v ) + n p 3 ( v ) = 3 , then v is called a terrible 5-vertex. A ( 3 , 3 , 5 ) -face adjacent to a terrible 5-vertex is called a terrible 3-face. Let N p 3 * ( v ) = { u u is a pendant vertex of v and u is incident with a ( 3 , 3 , 4 ) -face or a terrible ( 3 , 3 , 5 ) -face } , and denote n p 3 * ( v ) = | N p 3 * ( v ) | .

2. Structure of a Minimal Counterexample

In the rest of this paper, we assume that G is a minimal counterexample to Theorem 1. That is, G does not admit an ( F 2 , F 7 ) -partition, but every proper subgraph of G admits an ( F 2 , F 7 ) -partition. Clearly, G is connected and has minimum degree at least 2.
If ( A 2 , A 7 ) is an ( F 2 , F 7 ) -partition of some subgraph of G, we call ( A 2 , A 7 ) a partial ( F 2 , F 7 ) -partition of G. We let ( A 2 , A 7 ) be a partial ( F 2 , F 7 ) -partition of G and let v be a vertex of G. For i { 2 , 7 } , if u N ( v ) A i , then we say that u is an A i -neighbor of v. If v has i A i -neighbors and v A i , then v is called A i -saturated.
Lemma 1.
Let v be a vertex in G and i { 2 , 7 } . If ( A 2 , A 7 ) is a partial ( F 2 , F 7 ) -partition of G v ,
(1)
the neighbors of v are not in the same part;
(2)
if u is the unique A i -neighbor of v, then u is A i -saturated, and it has at least an A 9 i -neighbor. That is, u is an ( i + 2 ) + -vertex;
(3)
if u is the unique A i -neighbor of v and d ( u ) = i + 2 , then u has an A 9 i -saturated neighbor w which is an ( 11 i ) + -vertex.
Proof. 
(1) If u A i for each u N ( v ) , then ( A i , A 9 i + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction.
(2) If u is not A i -saturated, then since u is unique A i -neighbor of v, ( A i + v , A 9 i ) is an ( F 2 , F 7 ) -partition of G. If u has no A 9 i -neighbor, then ( A i u + v , A 9 i + u ) is an ( F 2 , F 7 ) -partition of G. Hence u must be A i -saturated and has at least an A 9 i -neighbor, so u is an ( i + 2 ) + -vertex.
(3) By Lemma 1(2), u is A i -saturated and has at least one A 9 i -neighbor w. If w is not A 9 i -saturated, then ( A i u + v , A 9 i + u ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If w has no A i -neighbor other than u, then ( A i u + w + v , A 9 i w + u ) is an ( F 2 , F 7 ) -partition of G, a contradiction. So, w is A 9 i -saturated and w has no A i -neighbor other than u, where u A i . Thus w is an ( 11 i ) + -vertex. □
For a 2-vertex v of G, by Lemma 1(1) and (2), one neighbor of v is an A 2 -saturated 4 + -vertex and the other is an A 7 -saturated 9 + -vertex.
Lemma 2.
G contains no ( 2 , 4 , 9 ) -face.
Proof. 
Assume to the contrary that f = [ v v 1 v 2 ] is a ( 2 , 4 , 9 ) -face in G, where d ( v ) = 2 , d ( v 1 ) = 4 and d ( v 2 ) = 9 . Let ( A 2 , A 7 ) be an ( F 2 , F 7 ) -partition of G v , with v 1 being A 2 -saturated and v 2 is A 7 -saturated. Then ( A 2 v 1 + v 2 + v , A 7 v 2 + v 1 ) is an ( F 2 , F 7 ) -partition of G, a contradiction. □
Lemma 3.
G contains no special ( 3 , 3 , 5 ) -face.
Proof. 
Suppose f = [ u v w ] is a special 3-face with d ( v ) = 5 and d ( u ) = d ( w ) = 3 . Let the external 8 -neighbors of v be v 1 , v 2 , v 3 , and the external neighbor of u and w be u 1 and w 1 , with d ( u 1 ) = 3 . By minimality of G, G u has an partial ( F 2 , F 7 ) -partition ( A 2 , A 7 ) . By Lemma 1(1) and (2), v is unique A 2 -saturated neighbor of u and w , u 1 A 7 . By symmetry, assume v 1 , v 2 A 2 and v 3 A 7 . If v 3 is A 7 -saturated, then ( A 2 v + v 3 + u , A 7 v 3 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Therefore, v 3 is not A 7 -saturated. If w 1 A 2 , then ( A 2 v + u , A 7 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If w 1 A 7 , then ( A 2 v + w + u , A 7 w + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. □
Lemma 4.
Let v be a 3-vertex of G. If v is incident to a ( 3 , 4 , 4 ) -face, then v has an external 4 + -neighbor.
Proof. 
Let f = [ v v 1 v 2 ] be a ( 3 , 4 , 4 ) -face, and suppose v has an external 3 -neighbor v 3 . By minimality of G, G v admits a partial ( F 2 , A 7 ) -partition ( A 2 , A 7 ) . By Lemma 1(1), since v is a 3-vertex, it must have a unique A i -neighbor v j for some i { 2 , 7 } . By Lemma 1(2), v j is A i -saturated with d ( v j ) i + 2 4 . By symmetry, assume v 1 is the unique A i -neighbor of v with d ( v 1 ) i + 2 . Since v 1 is a 4 -vertex, v 1 is A 2 -saturated, and the external neighbors of v 1 lie in A 7 . Hence v 2 , v 3 A 7 , since v 2 is not A 7 -saturated, then ( A 2 v 1 + v , A 7 + v 1 ) is an ( F 2 , F 7 ) -partition of G, a contradiction. □
Lemma 5.
Let v be a poor 4-vertex of G. Then n 2 ( v ) = n p 3 * ( v ) = 0 .
Proof. 
Suppose n 2 ( v ) 1 . Let u be a good 2-neighbor of v. Let ( A 2 , A 7 ) be an ( F 2 , F 7 ) -partition of G u . Since d ( v ) = 4 , v is the only A 2 -neighbor of u. Hence, by Lemma 1(3), v has a 9 + -neighbor. So, v is a rich 4-vertex of G, a contradiction.
Suppose n p 3 * ( v ) 1 . Assume that a pendant face f = [ u x y ] of v is either a terrible ( 3 , 3 , 5 ) -face or a ( 3 , 3 , 4 ) -face, where u is the pendant vertex of v and f is a ( 3 , 3 , 5 ) -face. Let ( A 2 , A 7 ) be an ( F 2 , F 7 ) -partition of G u .
By Lemma 1(1) and (2), u has exactly one A i -neighbor, and this neighbor is an A i -saturated ( i + 2 ) + -vertex. Since all neighbors of u are 5 -vertex, u has a unique A 2 -saturated neighbor. If v is the unique A 2 -saturated neighbor of u, then by Lemma 1(3), v has a 9 + -neighbor, a contradiction. If y is the unique A 2 -saturated neighbor of u, then x , v A 7 and d ( y ) 4 . When d ( y ) = 4 , all external neighbors of y lie in A 2 . In this case, ( A 2 y + u , A 7 + y ) is an ( F 2 , F 7 ) -partition of G, a contradiction. When d ( y ) = 5 , the face f is a terrible ( 3 , 3 , 5 ) -face and the external neighbors of y are all 3 -vertex. If the external neighbor of x belongs to A 2 , then ( A 2 y + u , A 7 + y ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If the external neighbor of x belongs to A 7 , then ( A 2 y + u + x , A 7 + y x ) is an ( F 2 , F 7 ) -partition of G, a contradiction. □
Lemma 6.
Let v be a 4-vertex of G, and suppose that v is incident with a ( 3 , 4 , 5 ) -face f = [ u v w ] , where u is a poor 3-vertex. If w is not a rich 5-vertex, then n 2 ( v ) + n p 3 ( v ) 1 .
Proof. 
Let u 1 be the external neighbor of u, and let v 1 , v 2 be the external neighbors of v. Assume that n 2 ( v ) + n p 3 ( v ) = 2 . Then all neighbors of v are 5 -vertex. By Lemma 5, n 2 ( v ) = 0 . Hence n p 3 ( v ) = 2 , see Figure 1. Let ( A 2 , A 7 ) be an ( F 2 , F 7 ) -partition of G u . Since u is a poor 3-vertex, by Lemma 1(2), u does not have a unique A 7 -neighbor. Thus u has exactly one A 2 -neighbor.
If v is the unique A 2 -neighbor of u, then v is A 2 -saturated and v 1 , v 2 A 2 , while u 1 , w A 7 . Then, ( A 2 v + u , A 7 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Hence v A 7 .
If u 1 is the unique A 2 -neighbor of u, then u 1 is A 2 -saturated. If at least one of v 1 , v 2 belongs to A 7 , then ( A 2 + v , A 7 v + u ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Thus v 1 , v 2 A 2 . Let f 1 = [ v 1 x y ] be the ( 3 , 8 , 8 ) -face incident with v 1 . If x , y A 7 , then ( A 2 + v , A 7 v + u ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Hence, exactly one of x , y belongs to A 7 . Without loss of generality, assume x A 7 and y A 2 . Then x is not A 7 -saturated, and thus ( A 2 v 1 + v , A 7 v + v 1 + u ) is an ( F 2 , F 7 ) -partition of G, a contradiction.
From the above arguments, we conclude that w is the unique A 2 -neighbor of u. Thus, w is A 2 -saturated. If d ( w ) = 4 , then ( A 2 w + u , A 7 + w ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If d ( w ) = 5 , let w 1 , w 2 , w 3 be the three external 8 -neighbors of w with w 1 , w 2 A 2 and w 3 A 7 . If w 3 is A 7 -saturated, then ( A 2 w + w 3 + u , A 7 w 3 + w ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Hence, w 3 is not A 7 -saturated. If at least one of v 1 , v 2 belongs to A 7 , then ( A 2 w + v + u , A 7 v + w ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Thus, v 1 , v 2 A 2 . In this case, ( A 2 w + u , A 7 + w ) is an ( F 2 , F 7 ) -partition of G, a contradiction. □
Figure 1. Lemma 6.
Figure 1. Lemma 6.
Mathematics 14 01153 g001
Lemma 7.
Let v be a rich 5-vertex of G. If v is incident with a ( 2 , 5 , 9 ) -face, then v has at least one external 9 + -neighbor.
Proof. 
Let f = [ u v w ] be a ( 2 , 5 , 9 ) -face and suppose that the three external neighbors v 1 , v 2 , v 3 of v are all 8 -vertices. Let ( A 2 , A 7 ) be an ( F 2 , F 7 ) -partition of G u . Then v is A 2 -saturated and w is A 7 -saturated. Since d ( w ) = 9 and v A 2 , it follows that all external neighbors of w belong to A 7 . By symmetry, we may assume that v 1 , v 2 A 2 and v 3 A 7 . If v 3 is A 7 -saturated, then ( A 2 v + v 3 + u + w , A 7 w v 3 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If v 3 is not A 7 -saturated, then ( A 2 v + w + u , A 7 + v w ) is an ( F 2 , F 7 ) -partition of G, also a contradiction. □
Lemma 8.
Let v be an 8 -vertex of G, and let v 1 N 2 ( v ) N p 3 * ( v ) . For an ( F 2 , F 7 ) -partition ( A 2 , A 7 ) of G v 1 , the following hold:
(1)
v is A 2 -saturated and every neighbor of v 1 other than v belongs to A 7 ;
(2)
if v is a poor 5-vertex and v 2 ( v 1 ) N 2 ( v ) N p 3 * ( v ) , then v 2 A 2 .
Proof. 
( 1 ) When v 1 N 2 ( v ) , by Lemma 1, v is A 2 -saturated and the other neighbor of v 1 is A 7 -saturated. Now suppose v 1 N p 3 * ( v ) . Let f = [ v 1 x y ] be a pendant 3-face of v with d ( x ) = 3 and let x 1 be the external neighbor of x. Since all neighbors of v 1 are 8 -vertices, exactly one of v , x , y is A 2 -saturated and the other two belong to A 7 . Clearly x is not A 2 -saturated. If y is A 2 -saturated, then by Lemma 1(2) and (3), d ( y ) = 5 . Thus, f is a terrible ( 3 , 3 , 5 ) -face. If x 1 A 2 , then ( A 2 y + v 1 , A 7 + y ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If x 1 A 7 , then ( A 2 y + x + v 1 , A 7 x + y ) is an ( F 2 , F 7 ) -partition of G, a contradiction.
( 2 ) Suppose v 2 A 7 . By ( 1 ) , v is A 2 -saturated and all neighbors of v 1 other than v belong to A 7 . Assume that another neighbor v 3 of v belongs to A 7 . If v 3 is A 7 -saturated, then ( A 2 v + v 1 + v 3 , A 7 v 3 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Hence, v 3 is not A 7 -saturated. If all neighbors of v 2 belong to A 2 , then ( A 2 v + v 1 , A 7 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Thus v 2 has at least one neighbor in A 7 .
If v 2 N 2 ( v ) , let N ( v 2 ) = { v , x } with x A 7 . Then ( A 2 v + v 2 + v 1 , A 7 v 2 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If v 2 N p 3 * ( v ) , let N ( v 2 ) = { v , x , y } and assume x A 2 , y A 7 . If x is not A 2 -saturated, then ( A 2 v + v 2 + v 1 , A 7 v 2 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Hence, x is A 2 -saturated and thus d ( x ) 4 .
If d ( x ) = 4 , then all external neighbors of x belong to A 2 . Then ( A 2 v x + v 2 + v 1 , A 7 v 2 + v + x ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If d ( x ) = 5 , then x is a terrible 5-vertex and d ( y ) = 3 . In this case, x has exactly one external neighbor in A 7 , which is not A 7 -saturated. Let N ( y ) = { v 2 , y 1 } . If y 1 A 2 , then ( A 2 v + v 1 , A 7 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If y 1 A 7 , then ( A 2 v x + v 2 + y + v 1 , A 7 v 2 y + v + x ) is an ( F 2 , F 7 ) -partition of G, a contradiction. □
Lemma 9.
Let v be a poor 5-vertex of G. Then n 2 ( v ) + n p 3 * ( v ) 3 . In particular, if v is incident with a special 3-face, then n 2 ( v ) + n p 3 * ( v ) 2 .
Proof. 
Let N ( v ) = { v 1 , v 2 , , v 5 } . Suppose n 2 ( v ) + n p 3 * ( v ) 4 . Without loss of generality assume that v 1 , v 2 , v 3 , v 4 N 2 ( v ) N p 3 * ( v ) . For an ( F 2 , F 7 ) -partition ( A 2 , A 7 ) of G v 1 , by Lemma 8(1), v is A 2 -saturated. By Lemma 8(2), v 2 , v 3 , v 4 A 2 , a contradiction.
Now suppose that v is incident with a special 3-face and n 2 ( v ) + n p 3 * ( v ) = 3 . Assume v 1 , v 2 , v 3 N 2 ( v ) N p 3 * ( v ) and let the special 3-face be f = [ v v 4 v 5 ] , where d ( v 4 ) = 3 and the external neighbor of v 4 is a 3-vertex x. By Lemma 8(1), v is A 2 -saturated. By Lemma 8(2), v 2 , v 3 A 2 . Thus, v 4 , v 5 A 7 . If x A 7 , then ( A 2 v + v 4 + v 1 , A 7 v 4 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If x A 2 , since x is a 3-vertex, if x is A 2 -saturated, then ( A 2 v x + v 4 + v 1 , A 7 v 4 + v + x ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Thus, x is not A 2 -saturated, and ( A 2 v + v 4 + v 1 , A 7 v 4 + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. □
Lemma 10.
Let v be a poor 6-vertex of G. If v is incident with a special ( 3 , 3 , 6 ) -face, then n 2 ( v ) + n p 3 * ( v ) 2 .
Proof. 
Assume that n 2 ( v ) + n p 3 * ( v ) 3 . Let f = [ x y v ] be a special ( 3 , 3 , 6 ) -face, where the external neighbors of v are v 1 , v 2 , v 3 , v 4 , and the external neighbors of x and y are x 1 and y 1 , respectively, with d ( x 1 ) = 3 . Without loss of generality, assume that v 1 , v 2 , v 3 N 2 ( v ) N p 3 * ( v ) . Let ( A 2 , A 7 ) be an ( F 2 , F 7 ) -partition of G x . By Lemma 1(1) and (2), we have x 1 , y A 7 and v is A 2 -saturated. Thus, at least one of v 1 , v 2 , v 3 belongs to A 7 . Without loss of generality, assume v 1 A 7 . If y 1 A 2 , then ( A 2 , A 7 + x ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Hence, y 1 A 7 . If all neighbors of v 1 belong to A 2 , then ( A 2 v + x + y , A 7 y + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Therefore, v 1 has at least one neighbor in A 7 . If v 1 N 2 ( v ) , let N ( v 1 ) = { v , u } , then u A 7 . In this case, ( A 2 v + v 1 + x + y , A 7 v 1 y + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If v 1 N p 3 * ( v ) , let N ( v 1 ) = { v , u , w } , and assume u A 2 , w A 7 . If u is not A 2 -saturated, then ( A 2 v + v 1 + x + y , A 7 v 1 y + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Thus, u is A 2 -saturated, and hence d ( u ) 4 . When d ( u ) = 4 , ( A 2 v u + v 1 + x + y , A 7 v 1 y + u + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. When d ( u ) = 5 , u is a terrible 5-vertex and d ( w ) = 3 . Let N ( w ) = { v 1 , w 1 , u } . Then u has exactly one external neighbor in A 7 , and it is not A 7 -saturated. If w 1 A 2 , then ( A 2 v u + v 1 + x + y , A 7 v 1 y + u + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If w 1 A 7 , then ( A 2 v u + v 1 + x + y + w , A 7 w v 1 y + u + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. □
For a ( 3 , 5 , 5 ) -face f = [ u v w ] , where u is a poor 3-vertex, w is a terrible 5-vertex, and v has three pendant faces which are ( 3 , 3 , 3 ) -faces or terrible ( 3 , 3 , 5 ) -faces, we call f a bad 3-face. The edge v w is called the ( 5 , 5 ) -edge of f. Let the external neighbors of v and w be v 1 , v 2 , v 3 and w 1 , w 2 , w 3 , respectively. For this bad 3-face f, the following two results hold.
Lemma 11.
For the above bad 3-face f, let ( A 2 , A 7 ) be an ( F 2 , F 7 ) -partition of G v 1 . Then w 1 , w 2 , w 3 A 2 , and all neighbors of w 1 , w 2 , w 3 belong to A 7 .
Proof. 
Let N ( v 1 ) = { v , x , y } . When d ( w 1 ) = 2 , let N ( w 1 ) = { w , z } ; when d ( w 1 ) = 3 , let N ( w 1 ) = { w , z , t } . By Lemma 8 ( 1 ) , v is A 2 -saturated and x , y A 7 . By Lemma 8 ( 2 ) , v 2 , v 3 A 2 . Hence, u , w A 7 . Next, we prove that w 1 , w 2 , w 3 A 2 .
If at most one of w 1 , w 2 , w 3 belongs to A 2 , then ( A 2 v + w + v 1 , A 7 w + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If two of them belong to A 2 , say w 1 , w 2 A 2 . If w 1 N 2 ( w ) , when z A 2 , ( A 2 v w 1 + w + v 1 , A 7 w + v + w 1 ) is an ( F 2 , F 7 ) -partition of G, a contradiction; when z A 7 , ( A 2 v + w + v 1 , A 7 w + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If w 1 N p 3 ( w ) , when z , t A 7 , ( A 2 v + w + v 1 , A 7 w + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If one of z , t belongs to A 2 , say z A 2 , then ( A 2 v w 1 + w + v 1 , A 7 w + v + w 1 ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Thus, w 1 , w 2 , w 3 A 2 . Now, we prove that all neighbors of w 1 , w 2 , w 3 belong to A 7 .
Suppose that w 1 , w 2 , w 3 has at least one neighbor in A 2 . For each i { 1 , 2 , 3 } , if w i has a neighbor in A 2 , move w i from A 2 to A 7 . After performing this modification, obtain another ( F 2 , F 7 ) -partition ( A 2 , A 7 ) of G. Since w is a terrible 5-vertex, ( A 2 v + w + v 1 , A 7 w + v ) is an ( F 2 , F 7 ) -partition of G, a contradiction. Hence, all neighbors of w 1 , w 2 , w 3 belong to A 7 . □
Lemma 12.
The ( 5 , 5 ) -edge v w of the above bad 3-face f is incident with a 7 + -face.
Proof. 
Since 3-faces are not adjacent and G contains no 4-cycles or 5-cycles, we may assume that v w is incident with a 6-face f 1 . Without loss of generality, let f 1 = [ v v 1 y z w 1 w ] . For an ( F 2 , F 7 ) -partition ( A 2 , A 7 ) of G v 1 , by Lemma 11, we have w 1 , w 2 , w 3 A 2 and all their neighbors belong to A 7 . If d ( y ) = 3 , then ( A 2 + y , A 7 y + v 1 ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If d ( y ) = 5 , then y is a terrible 5-vertex. Let N ( y ) = { v 1 , x , z , y 1 , y 2 } . Then, y 1 , y 2 A 2 ; otherwise, ( A 2 + y , A 7 y + v 1 ) is an ( F 2 , F 7 ) -partition of G, a contradiction. For i = 1 , 2 , if some y i has all its neighbors in A 7 , then ( A 2 + y , A 7 y + v 1 ) is an ( F 2 , F 7 ) -partition of G, a contradiction. If some y i has one neighbor in A 2 and the other in A 7 , then ( A 2 y i + y , A 7 y + y i + v 1 ) is an ( F 2 , F 7 ) -partition of G, a contradiction. □

3. Discharging

Let the initial charge of a vertex v in G be μ ( v ) = 2 d ( v ) 6 , and the initial charge of a face f be μ ( f ) = d ( f ) 6 . By Euler’s formula | V ( G ) | | E ( G ) | + | F ( G ) | = 2 , we obtain v V ( G ) μ ( v ) + f F ( G ) μ ( f ) = 12 . Next, we design a series of discharging rules and redistribute the charges so that the final charge of every vertex and every face is nonnegative. However, the total charge remains unchanged, which leads to a contradiction. Let μ ( v ) and μ ( f ) denote the final charges of a vertex v and a face f in G, respectively.
If v is adjacent to a 3-face f, we define τ ( v f ) as the charge that v sends to f. If x is a neighbor of v, we define τ ( v x ) as the charge that v sends to x. The discharging rules are as follows.
R1
Let v be a 4-vertex and suppose that v is incident with a 3-face f. Then
τ ( v f ) = 3 2 , if f is a ( 3 , 4 , 5 ) -face , f is adjacent to a poor 3 -vertex but not adjacent to a rich 5 -vertex , 1 , otherwise .
R2
Let v be a d-vertex with 6 d 8 , and suppose that v is incident with a 3-face f. Then
τ ( v f ) = 3 , if f is a special ( 3 , 3 , d ) -face , 2 , otherwise .
R3
Let v be a d-vertex with d 9 , and suppose that v is incident with a 3-face f. Then
τ ( v f ) = 3 , if f is a ( 3 , 3 , d ) -face , ( 2 , 4 , d ) -face , or ( 2 , 5 , d ) -face , 1 , if f is a ( 4 + , 4 + , d ) -face , 2 , otherwise .
R4
Let v be a d-vertex with 4 d 8 . Then
τ ( v x ) = 1 , if x is a pendant ( 3 , 3 , 3 ) -face of v or a terrible ( 3 , 3 , 5 ) -face of v , 3 4 , if x is a pendant ( 3 , 3 , 4 ) -face of v , or x is a good 2 -neighbor of v , 1 2 , if x is any other pendant 3 -face of v .
R5
Let v be a 9 + -vertex. Then
τ ( v x ) = 5 4 , if x is a good 2 -neighbor of v , or x is a pendant 3 -face of v , 1 , if x is a 4 -neighbor of v , or x is a 5 -neighbor of v and v is an external neighbor of x .
R6
Each 3-face sends 1 to each incident bad 2-vertex; each 7 + -face f sends 1 to each incident bad 2-vertex, and sends 1 2 to each bad 3-face adjacent to f with common edge being a ( 5 , 5 ) -edge.
Let α ( v ) denote the final charge of a 5-vertex v after applying Rules R4 and R5.
R7
Each 5-vertex v sends α ( v ) to each incident 3-face.
Lemma 13.
For every face f of G, we have μ ( f ) 0 .
Proof. 
Since G contains no 4-cycles and no 5-cycles, G has no 4-faces or 5-faces. Because there is no charge transfer between a 6-face and other vertices or faces, we have μ ( f ) = μ ( f ) = k 6 = 0 . Hence, it suffices to consider 7 + -faces and 3-faces. Let f be a k-face. If k 7 , let t 1 be the number of bad 2-vertices incident with f, and let t 2 be the number of bad 3-faces adjacent to f such that the common edge is a ( 5 , 5 ) -edge.
Case 1.  k = 7 .
If t 2 = 0 , clearly t 1 1 . If t 2 0 , by the structure of bad 3-faces we have t 1 = 0 and t 2 2 . Hence, t 1 + t 2 2 1 . By R6, μ ( f ) = k 6 t 1 t 2 2 0 .
Case 2.  k 8 .
Since the vertices of triangles are pairwise disjoint and by the construction of bad 3-faces, we have t 1 + t 2 k 3 . By R6, μ ( f ) = k 6 t 1 t 2 2 k 6 k 3 . When k = 8 , μ ( f ) 8 6 2 = 0 ; when k 9 , μ ( f ) k 6 k 3 = 2 k 18 3 0 .
Case 3.  k = 3 .
Suppose that f is incident with a 5-vertex v. By R4 and R5 we obtain the following bounds for α ( v ) : If v has an external 9 + -neighbor, then α ( v ) 4 + 1 1 × 2 = 3 . If v is poor but not a terrible 5-vertex, then α ( v ) 4 1 × 2 = 2 . If v is a terrible 5-vertex and f is a special 3-face, then by Lemma 9, n 2 ( v ) + n p 3 * ( v ) 2 , hence α ( v ) 4 1 × 2 1 2 = 3 2 . If v is a terrible 5-vertex and f is not a special 3-face but the number of pendant ( 3 , 3 , 3 ) -faces and terrible ( 3 , 3 , 5 ) -faces of v is at most 2, then α ( v ) 4 1 × 2 3 4 = 5 4 . Otherwise α ( v ) 4 1 × 3 = 1 .
Let f = [ v 1 v 2 v 3 ] with d ( v 1 ) d ( v 2 ) d ( v 3 ) . Suppose d ( v 1 ) 4 . By R1, R2, R3 and R7, every 4 + -vertex sends at least 1 to f. Hence, μ ( f ) μ ( f ) + 1 × 3 = 0 . Suppose d ( v 1 ) = 2 . When d ( v 2 ) = 4 , by Lemma 2, d ( v 3 ) 10 . By R1, R3 and R6, μ ( f ) = μ ( f ) 1 + 1 + 3 = 0 . When d ( v 2 ) = 5 , by R3, R6 and R7, μ ( f ) = μ ( f ) 1 + α ( v 2 ) + 3 3 1 + 1 + 3 = 0 . When d ( v 2 ) 6 , by R2, R3 and R6, μ ( f ) = μ ( f ) 1 + 2 + 2 = 0 . Suppose d ( v 1 ) = 3 . If d ( v 2 ) 6 , then by R2 and R3, μ ( f ) = μ ( f ) + 2 + 2 = 1 . Next, consider the case 3 d ( v 2 ) 5 .
Case 3.1.  d ( v 2 ) = 3 .
When d ( v 3 ) = 3 , by Lemma 4, v 1 , v 2 , v 3 each has an external 4 + -neighbor. By R4 and R5, μ ( f ) μ ( f ) + 1 × 3 = 0 . When d ( v 3 ) = 4 , by Lemma 4, both v 1 and v 2 have external 4 + -neighbors. If both v 1 and v 2 are rich vertices, then by R1 and R5, μ ( f ) = μ ( f ) + 1 + 5 4 × 2 = 1 2 . Otherwise, by R1, R4 and R5, μ ( f ) μ ( f ) + 3 2 + 3 4 + 3 4 = 0 . When 6 d ( v 3 ) 8 , if f is special, then by R2, μ ( f ) μ ( f ) + 3 = 0 ; if f is not special, then by R2, R4 and R5, μ ( f ) μ ( f ) + 2 + 1 2 + 1 2 = 0 . When d ( v 3 ) 9 , by R3, μ ( f ) μ ( f ) + 3 = 0 .
When d ( v 3 ) = 5 , by Lemma 3, f is not a special 3-face, and hence both v 1 and v 2 have external 4 + -neighbors. Assume that v 3 is a rich 5-vertex. Then v 3 has an external 9 + -neighbor. By R7, μ ( f ) μ ( f ) + α ( v 3 ) 3 + 3 = 0 . Assume that v 3 is a poor 5-vertex. If v 3 is a terrible 5-vertex, then f is a terrible ( 3 , 3 , 5 ) -face. By R4, R5 and R7, μ ( f ) μ ( f ) + α ( v 3 ) + 1 × 2 3 + 1 + 1 × 2 = 0 . If v 3 is not a terrible 5-vertex, then μ ( f ) = μ ( f ) + α ( v 3 ) + 1 2 × 2 3 + 2 + 1 = 0 . The summary of the final charge is shown in Table 1.
Case 3.2.  d ( v 2 ) = 4 .
When d ( v 3 ) = 4 , if v 1 is rich, then by R1 and R5, μ ( f ) = μ ( f ) + 1 × 2 + 1 = 0 . If v 1 is poor, then by R1 and R4, μ ( f ) = μ ( f ) + 3 2 × 2 + 1 2 = 1 2 . When d ( v 3 ) 6 , by R1, R2 and R3, μ ( f ) = μ ( f ) + 1 + 2 = 0 .
When d ( v 3 ) = 5 , if v 3 is a rich 5-vertex, then v 3 has an external 9 + -neighbor. By R7, μ ( f ) = μ ( f ) + α ( v 3 ) + 1 3 + 3 + 1 = 1 . If v 3 is poor but not a terrible 5-vertex, then by R1 and R7, μ ( f ) = μ ( f ) + α ( v 3 ) + 1 3 + 2 + 1 = 0 . If v 3 is a terrible 5-vertex and f is a special 3-face, then v 1 is a poor 3-vertex. By R1 and R7, μ ( f ) = μ ( f ) + α ( v 3 ) + 3 2 3 + 3 2 + 3 2 = 0 . If v 3 is a terrible 5-vertex and f is not a special 3-face, then by R1, R4, R5 and R7, μ ( f ) = μ ( f ) + α ( v 3 ) + min 1 2 + 3 2 , 1 + 1 3 + 1 + 2 = 0 . The summary of the final charge is shown in Table 2.
Case 3.3.  d ( v 2 ) = 5 .
When d ( v 3 ) 6 , by R2, R3 and R7, μ ( f ) = μ ( f ) + α ( v 2 ) + 2 3 + 1 + 2 = 0 . When d ( v 3 ) = 5 , if at least one of v 2 and v 3 is a rich 5-vertex, without loss of generality assume that v 2 is a rich 5-vertex. Then v 2 has an external 9 + -neighbor. By R7, μ ( f ) = μ ( f ) + α ( v 2 ) + α ( v 3 ) 3 + 3 + 1 = 1 . If both v 2 and v 3 are poor 5-vertices and at least one of them is not a terrible 5-vertex, then μ ( f ) = μ ( f ) + α ( v 2 ) + α ( v 3 ) 3 + 1 + 2 = 0 . If both v 2 and v 3 are terrible 5-vertices and f is a special 3-face, then μ ( f ) = μ ( f ) + α ( v 2 ) + α ( v 3 ) 3 + 3 2 + 3 2 = 0 . Now assume that both v 2 and v 3 are terrible 5-vertices and f is not a special 3-face. If the numbers of pendant ( 3 , 3 , 3 ) -faces and terrible ( 3 , 3 , 5 ) -faces incident with v 2 and v 3 are at most 2, then by R4, R5 and R7, μ ( f ) μ ( f ) + α ( v 2 ) + α ( v 3 ) + 1 2 3 + 5 4 + 5 4 + 1 2 = 0 . If at least one of v 2 and v 3 is incident with three pendant ( 3 , 3 , 3 ) -faces or terrible ( 3 , 3 , 5 ) -faces, then f is a bad 3-face or v 1 is a rich 3-vertex. By Lemma 12 and R4, R5, R6 and R7, μ ( f ) μ ( f ) + α ( v 2 ) + α ( v 3 ) + min 1 2 + 1 2 , 1 3 + 1 + 1 + 1 = 0 . The summary of the final charge is shown in Table 3. □
Lemma 14.
For every vertex v of G, we have μ ( v ) 0 .
Proof. 
Since a 3-vertex sends no charge, μ ( v ) = μ ( v ) = 0 . Let v be a d-vertex.
Case 1.  d = 2 .
If v is a bad 2-vertex, then v is incident with a 3-face and a 7 + -face. By R6, μ ( v ) = μ ( v ) + 1 + 1 = 0 . If v is a good 2-vertex, by R4 and R5, μ ( v ) μ ( v ) + 3 4 + 5 4 = 0 .
Case 2.  d = 4 .
By Lemma 6, if v is incident with a ( 3 , 4 , 5 ) -face f such that f is adjacent to a poor 3-vertex but not adjacent to any rich 5-vertex, then n 2 ( v ) + n p 3 ( v ) 1 .
Suppose that v is a poor 4-vertex. By Lemma 5, we have n 2 ( v ) = n p 3 * ( v ) = 0 . When v is incident with the above ( 3 , 4 , 5 ) -face f, by R1 and R4, μ ( v ) μ ( v ) 3 2 1 2 = 0 . When v is incident with other 3-faces, by R1 and R4, μ ( v ) μ ( v ) 1 1 2 × 2 = 0 . When v is not incident with any 3-face, by R1 and R4, μ ( v ) μ ( v ) 1 2 × 4 = 0 .
Suppose that v is a rich 4-vertex. When v is incident with the above ( 3 , 4 , 5 ) -face f, then v has an external 9 + -neighbor. By R1, R4 and R5, μ ( v ) μ ( v ) + 1 3 2 1 = 1 2 . When v is incident with other 3-faces, by R1, R4 and R5, μ ( v ) μ ( v ) + 1 1 × 2 1 = 0 . When v is not incident with any 3-face, by R1, R4 and R5, μ ( v ) μ ( v ) + 1 1 × 3 = 0 .
Case 3.  d = 5 .
If v is incident with a 3-face, then by R4, α ( v ) 4 1 × 3 = 1 . Hence, by R7, μ ( v ) = α ( v ) α ( v ) = 0 . Assume that v is not incident with any 3-face. If v is a rich 5-vertex, then n 2 ( v ) + n p 3 ( v ) 4 . By R4, μ ( v ) μ ( v ) 1 × 4 = 0 . If v is a poor 5-vertex, then by Lemma 9, n 2 ( v ) + n p 3 * ( v ) 3 . By R4, μ ( v ) μ ( v ) 1 × 3 1 2 × 2 = 0 .
Case 4.  6 d 8 .
If v is not incident with any 3-face, then by R4, μ ( v ) μ ( v ) d × 1 = d 6 0 . Now assume that v is incident with a 3-face. If 7 d 8 , then by R2 and R4, μ ( v ) μ ( v ) 3 ( d 2 ) × 1 = d 7 0 .
For d = 6 , if v is incident with a special ( 3 , 3 , 6 ) -face, then when v is rich, by R2 and R4, μ ( v ) μ ( v ) 3 3 × 1 = 0 ; when v is poor, by Lemma 10, n 2 ( v ) + n p 3 * ( v ) 2 . By R2 and R4, μ ( v ) μ ( v ) 3 2 × 1 2 × 1 2 = 0 . If v is incident with other 3-faces, then by R2 and R4, μ ( v ) μ ( v ) 2 4 × 1 = 0 .
Case 5.  d 9 .
If v is not incident with any 3-face, then by R5, μ ( v ) μ ( v ) 5 4 × d = 3 d 24 4 > 0 . Now assume that v is incident with a 3-face f = [ v v 1 v 2 ] . If both v 1 and v 2 are 3 -vertices, then f is a ( 3 , 3 , d ) -face. By R3 and R5, μ ( v ) μ ( v ) 3 5 4 × ( d 2 ) = 3 d 26 4 > 0 . If both v 1 and v 2 are 4 + -vertices, then by R3 and R5, μ ( v ) μ ( v ) 1 5 4 × ( d 2 ) 1 × 2 = 3 d 26 4 > 0 . If exactly one of v 1 and v 2 is a 4 + -vertex, assume without loss of generality that v 1 is a 4 + -vertex. Then v 2 is a 3 -vertex. By R5, v sends no charge to v 2 . When f is a ( 2 , 4 , d ) -face, by Lemma 2, d 10 . By R3 and R5, μ ( v ) μ ( v ) 3 5 4 × ( d 2 ) 1 = 3 d 30 4 0 . When f is a ( 2 , 5 , d ) -face, by R3 and R5, μ ( v ) μ ( v ) 3 5 4 × ( d 2 ) = 3 d 26 4 > 0 . When f is any other 3-face, by R3 and R5, μ ( v ) μ ( v ) 2 5 4 × ( d 2 ) 1 = 3 d 26 4 > 0 .

Author Contributions

Conceptualization, W.L.; Methodology, W.L.; Validation, M.H.; Writing—original draft, W.L.; Writing—review and editing, M.H.; Funding acquisition, M.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by the Natural Science Foundation of China No. 12261094.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study.

Acknowledgments

The authors gratefully acknowledge the financial support provided by this fund, which made this research possible.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Cowen, L.J.; Cowen, R.H.; Woodall, D.R. Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency. J. Graph Theory 1986, 10, 187–195. [Google Scholar] [CrossRef]
  2. Grotzsch, H. Ein Dreifarbensatz fur dreikreisfreie Netze auf der Kugel. Wiss. Z. Martin Luther Univ. Halle-Wittenb. Math. Nat. Reihe 1959, 8, 109–120. [Google Scholar]
  3. Steinberg, R. The state of the three color problem. Ann. Discret. Math. 1993, 55, 211–248. [Google Scholar] [CrossRef]
  4. Cohen-Addad, V.; Hebdige, M.; Král’, D.; Li, Z.; Salgado, E. Steinberg’s conjecture is false. J. Comb. Theory Ser. B 2017, 122, 452–456. [Google Scholar] [CrossRef]
  5. Chen, M.; Wang, Y.; Liu, P.; Xu, L. Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable. Discret. Math. 2016, 339, 886–905. [Google Scholar] [CrossRef]
  6. Sittitrai, P.; Nakprasit, K. Defective 2-colorings of planar graphs without 4-cycles and 5-cycles. Discret. Math. 2018, 341, 2142–2150. [Google Scholar] [CrossRef]
  7. Liu, J.; Lv, J. Every planar graph without 4-cycles and 5-cycles is (2, 6)-colorable. Bull. Malays. Math. Sci. Soc. 2020, 43, 2493–2507. [Google Scholar] [CrossRef]
  8. Li, X.; Liu, J.; Lv, J. Every planar graph without 4-cycles and 5-cycles is (3, 3)-colorable. Graphs Comb. 2023, 39, 118. [Google Scholar] [CrossRef]
  9. Cho, E.K.; Choi, I.; Park, B. Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests. Discret. Math. 2021, 344, 112172. [Google Scholar] [CrossRef]
  10. Tangjai, W.; Nakprasit, K.; Nakprasit, K.M.; Sittitrai, P. Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition. Discret. Appl. Math. 2024, 342, 347–354. [Google Scholar] [CrossRef]
  11. Wang, Y.; Wang, J.; Wang, W.; Kong, J. Partitioning planar graphs into bounded degree forests. Appl. Math. Comput. 2024, 474, 128705. [Google Scholar] [CrossRef]
  12. Hu, K.; Huang, M. An (F3, F4)-partition of planar graphs without 4-and 6-cycles. Discret. Appl. Math. 2025, 373, 1–9. [Google Scholar] [CrossRef]
  13. Huang, Z.; Li, X.; Niu, L. An (F2, F6)-partition of planar graphs without cycles of length 4 and 6. Discret. Appl. Math. 2025, 348, 114626. [Google Scholar] [CrossRef]
Table 1. Case 3.1: the final charges of f = [ v 1 v 2 v 3 ] .
Table 1. Case 3.1: the final charges of f = [ v 1 v 2 v 3 ] .
f = [ v 1 v 2 v 3 ] v 1 v 2 v 3 μ ( f )
( 3 , 3 , 3 ) 333 μ ( f ) 0
( 3 , 3 , 4 ) rich 3rich 34 μ ( f ) = 1 2
( 3 , 3 , 4 ) poor 334 μ ( f ) 0
( 3 , 3 , 5 ) 33rich 5 μ ( f ) 0
( 3 , 3 , 5 ) 33terrible 5 μ ( f ) 0
( 3 , 3 , 5 ) 33not terrible 5 μ ( f ) 0
( 3 , 3 , k ) is special33 6 k 8 μ ( f ) 0
( 3 , 3 , k ) is not special33 6 k 8 μ ( f ) 0
( 3 , 3 , 9 + ) 33 9 + μ ( f ) 0
Table 2. Case 3.2: the final charges of f = [ v 1 v 2 v 3 ] .
Table 2. Case 3.2: the final charges of f = [ v 1 v 2 v 3 ] .
f = [ v 1 v 2 v 3 ] v 1 v 2 v 3 μ ( f )
( 3 , 4 , 4 ) rich 344 μ ( f ) = 0
( 3 , 4 , 4 ) poor 344 μ ( f ) = 1 2
( 3 , 4 , 5 ) 34rich 5 μ ( f ) 1
( 3 , 4 , 5 ) is special34terrible 5 μ ( f ) 0
( 3 , 4 , 5 ) is not special34terrible 5 μ ( f ) 0
( 3 , 4 , 5 ) 34not terrible 5 μ ( f ) 0
( 3 , 4 , 6 + ) 34 6 + μ ( f ) = 0
Table 3. Case 3.3: the final charges of f = [ v 1 v 2 v 3 ] .
Table 3. Case 3.3: the final charges of f = [ v 1 v 2 v 3 ] .
f = [ v 1 v 2 v 3 ] v 1 v 2 v 3 μ ( f )
( 3 , 5 , 5 ) 3rich 55 μ ( f ) 1
( 3 , 5 , 5 ) 3not terrible 5poor 5 μ ( f ) 0
( 3 , 5 , 5 ) is special3terrible 5terrible 5 μ ( f ) 0
( 3 , 5 , 5 ) is not special3terrible 5terrible 5 μ ( f ) 0
( 3 , 5 , 6 + ) 35 6 + μ ( f ) 0
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Liu, W.; Huang, M. Planar Graphs with Sparse Triangles and Without 4-Cycles and 5-Cycles Admit (F2, F7)-Partition. Mathematics 2026, 14, 1153. https://doi.org/10.3390/math14071153

AMA Style

Liu W, Huang M. Planar Graphs with Sparse Triangles and Without 4-Cycles and 5-Cycles Admit (F2, F7)-Partition. Mathematics. 2026; 14(7):1153. https://doi.org/10.3390/math14071153

Chicago/Turabian Style

Liu, Wubing, and Mingfang Huang. 2026. "Planar Graphs with Sparse Triangles and Without 4-Cycles and 5-Cycles Admit (F2, F7)-Partition" Mathematics 14, no. 7: 1153. https://doi.org/10.3390/math14071153

APA Style

Liu, W., & Huang, M. (2026). Planar Graphs with Sparse Triangles and Without 4-Cycles and 5-Cycles Admit (F2, F7)-Partition. Mathematics, 14(7), 1153. https://doi.org/10.3390/math14071153

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop