Planar Graphs with Sparse Triangles and Without 4-Cycles and 5-Cycles Admit (F2, F7)-Partition
Mathematics · 30.03.2026 · 14 (7) · 1153
DOI: 10.3390/math14071153 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 30.03.2026. Verfasst von Wubing Liu und 1 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Natural Science Foundation of China.
Abstract (Originalsprache)
If the vertex set of a graph G can be partitioned into k subsets V1,V2,…,Vk, and the induced subgraph on each subset Vi is a forest whose maximum degree is at most di (i=1,…,k), then this partition is called an (Fd1,…,Fdk)-partition of G. Cho et al. (2021) conjectured that every planar graph without 4-cycles and 5-cycles admits an (F2,Fd)-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 (F2,F7)-partition. This result provides further support for the above conjecture.
Förderung
- Natural Science Foundation of China
Zitieren
APA
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
Vancouver
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. doi:10.3390/math14071153
BibTeX
@article{Liu2026,
author = {Liu, Wubing and Huang, Mingfang},
title = {Planar Graphs with Sparse Triangles and Without 4-Cycles and 5-Cycles Admit (F2, F7)-Partition},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {7},
pages = {1153},
doi = {10.3390/math14071153}
}
EUVIMED