4-圈不共點(diǎn)的平面圖的線性2-蔭度
發(fā)布時(shí)間：2018-11-20 17:46
【摘要】：圖G的線性2-蔭度la_2(G)是指可以使G分解為k個(gè)邊不相交森林的最小整數(shù)k,其中森林的每個(gè)分支是長(zhǎng)度至多為2的路。證明了若G是4-圈不共點(diǎn)的平面圖,則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) 鈮，
本文編號(hào)：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) 鈮，
本文編號(hào)：2345562
本文鏈接：http://sikaile.net/kejilunwen/yysx/2345562.html
最近更新
教材專著
