最大外可平面图的树图

The tree graph of maximal outerplanar graph

通过对最大外可平面图和 K临界图的研究给出三个主要结论( 1 )最大外可平面图的生成树有 2 p- 3* 3棵。( 2 )最大外可平面图的树图GT,Δ( GT)≥ p+ 1。( 3)临界图 G,当 K( G) =1时 ,树图 GT 是平凡图 ,当K( G) =2时 ;树图 GT是

In this paper,we give three main results by way of studying maximal outerplanar graph and K-critical graph: (1)There are 2 p-3 3 created trees in a maximal outerplanar graph. (2)The tree graph of maximal outerplanar graph satisfiesΔ(G T)≥p+1 (3)A K-critical graph G,if K(G)=1,then G T is a trivial;if K(G)=2,then G T is a p-cycle.