三正则二部平面图中2-因子的短圈
The Short Cycles of 2-factors in Cubic Bipartite Planar Graphs
张晓钰 1杨卫华1
作者信息
- 1. 太原理工大学数学学院,山西太原 030024
- 折叠
摘要
给出了猜想存在一个常数k(可能是8)使得每一个平面三正则无桥图存在一个2-因子,其中该2-因子有一个圈的长度最多为k的一部分解,证明了每一个三正则二部平面图都存在一个包含4-圈的2-因子.此外,还证明了三正则二部平面图中每一个4-圈都可以被扩展为一个2-因子.
Abstract
A partial solution is given for the conjecture that there is a constant k(perhaps 8)such that every planar cubic bridgeless graph has a 2-factor containing a cycle of length at most k.And it's proved that every cubic bipartite planar graph has a 2-factor containing a 4-cycle.Moreover,every 4-cycle can be extended to a 2-factor in cubic bipartite planar graphs.
关键词
2-因子/三正则二部平面图/4-圈Key words
2-factor/cubic bipartite planar graphs/4-cycle引用本文复制引用
出版年
2024
NETL
NSTL
万方数据