Decomposing planar graphs into graphs with degree restrictions
Eun‐Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park, Tingting Shan, Xuding Zhu · Journal of Graph Theory · 2022
Abstract Given a graph , a decomposition of is a partition of its edges. A graph is ‐decomposable if its edge set can be partitioned into a ‐degenerate graph and a graph with maximum degree at most . For , we are interested in the minimum integer such that every planar graph is ‐decomposable. It was known that , , and . This paper proves that , and .