4-圈不共点的平面图的线性2-荫度
发布时间：2018-11-20 17:46
【摘要】：图G的线性2-荫度la_2(G)是指可以使G分解为k个边不相交森林的最小整数k,其中森林的每个分支是长度至多为2的路。证明了若G是4-圈不共点的平面图,则la_2(G)≤「Δ/2■+5。
[Abstract]:The linear 2-shade degree la_2 (G) of graph G is the minimum integer k which can decompose G into k edge disjoint forests where each branch of the forest is a path of up to 2 in length. It is proved that if G is a planar graph with 4-cycle noncollocation, then la_2 (G) 鈮，
本文编号：2345562
[Abstract]:The linear 2-shade degree la_2 (G) of graph G is the minimum integer k which can decompose G into k edge disjoint forests where each branch of the forest is a path of up to 2 in length. It is proved that if G is a planar graph with 4-cycle noncollocation, then la_2 (G) 鈮，
本文编号：2345562
本文链接：https://www.wllwen.com/kejilunwen/yysx/2345562.html
