The Short Cycles of 2-factors in Cubic Bipartite Planar Graphs
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.
NETL
NSTL
万方数据
