Covering projective planar graphs with three forests
Covering projective planar graphs with three forests
复制标题
用三个森林覆盖射影平面图
DOI：
10.1016/j.disc.2021.112748
复制
发表时间：
2022
影响因子：
0.8
通讯作者：
Tazume Ryuji
中科院分区：
文献类型：
--
作者：
Mukae Raiji;Ozeki Kenta;Sano Terukazu;Tazume Ryuji
众所周知，所有平面图和所有射影平面图都有分成三个森林的边。Gonçalves证明了每个平面图都有三个森林的边划分，其中一个最大度至多四个[5]。本文证明了每个射影平面图都有三个森林的边划分，其中一个最大度至多为四个。
It is known that all planar graphs and all projective planar graphs have an edge partition into three forests. Gonçalves proved that every planar graph has an edge partition into three forests, one having maximum degree at most four [5]. In this paper, we prove that every projective planar graph has an edge partition into three forests, one having maximum degree at most four.
影响因子：
0.9
作者：
James Davies;Florian Pfender
通讯作者：
James Davies;Florian Pfender