外平面图的英文

• outer planar graph
• outer plane graph

• "外"英文翻译    outside; external side
• "平面图"英文翻译    planimetric map; plan; plane ...
• "平面图" 英文翻译 :    cut away view; flat graph; flat sheet; floor plan; ground plan; horizontal plan; ichnography; layout chart; layout plan; line map; orthographic plan; plain figure; plain view drawing; plan sheet; plan sketch; plan view drawing; plan, plan view; planar graph; plane figure; plane graph; plane view drawing; planform; planimetric map; plant view; surface diagram; tat; two dimensional layout
• "平面图，布局平面" 英文翻译 :    layout plans
• "坝区平面图" 英文翻译 :    plot plan
• "坝址平面图" 英文翻译 :    site plan
• "半平面图" 英文翻译 :    half-breadth plan
• "布局平面图" 英文翻译 :    layout plan
• "布置，平面图" 英文翻译 :    layout
• "部分平面图" 英文翻译 :    sectional plan
• "采样平面图" 英文翻译 :    assay map
• "测量平面图" 英文翻译 :    survey plan
• "场地平面图" 英文翻译 :    site plan
• "城市平面图" 英文翻译 :    city plan; cityplan
• "城镇平面图" 英文翻译 :    town plan
• "赤道平面图" 英文翻译 :    diagram on the plane of the equinoctial
• "出口平面图" 英文翻译 :    exit plan
• "船舶平面图" 英文翻译 :    ship's plan
• "大厦平面图" 英文翻译 :    building layout
• "带状平面图" 英文翻译 :    plan of a zone; zone plan; zoneplan
• "弹体平面图" 英文翻译 :    body-piston
• "道路平面图" 英文翻译 :    alinement
• "底层平面图" 英文翻译 :    ground floor plan; groundfloorplan
• "地层平面图" 英文翻译 :    ground plan
• "地籍平面图" 英文翻译 :    subdivision plat

• On the total coloring of a special double - outer planar graph
  一个特殊的双外平面图的全染色
• Bonunded colorings of outerplanar graphs
  外平面图的有界染色
• On the vertex strong total coloring of outerplane graphs with lower degree
  低度外平面图的点强全染色
• A polynomial algorithm for minimum - cardinality feedback vertex set problem in outerplanar graphs
  一个求外平面图最小反馈点集的多项式时间算法
• Maximal outer planar graph and perfect matching in the treelike triangular lattice and the treelike polyminoes
  极大外平面图与树状三角系统和四角系统的完美匹配
• We prove that halin graphs , 1 - trees and outerplanar graphs satisfy the conjecture presented by n . alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2
  证明了halin图、 1 -树和外平面图满足由n . alon提出的任何一个图的无圈边色数不超过其最大度加2的猜想。
• Nowadays , concerning the relaxed game chromatic number of tree , out - erplanar and partial k - tree graph have been studied by many researchers home and abroad , this paper studies further the relaxed game chromatic number of trees
  如今，关于树，外平面图及偏k -树的松弛竞赛染色已引起众多学者的研究，本文主要研究森林的松弛竞赛色数。
• In section four , by researching the properties of kneser graphs , we construct the homomorphism between the kneser graph and the outerplane graph . so the fr actional chromatic number and chromatic number are obtained
  在第四部分中通过对kneser图的一些性质的考察，在kneser图与外平面图之间建立同态关系，从而得到了外平面图的分数色数与顶点色数。
• The relaxed game chromatic number of tree , outerplanar graphs , partial k - tree and pseudo partial k - tree have been studied by many researchers home and abroad , this paper further studied the relaxed game chromatic number of partial k - tree based on the known research , according to appling a new activation strategy , we proved if the relaxed degree d > 2k + 1 , then for this ( r , d ) - relaxed coloring game , we have ( 2k + 1 ) - xg ( g ) < k + 1 , it is an improvement about the result in paper [ 2 ]
  对树，外平面图，偏k -树及伪偏k -树的松弛竞赛染色已在不同程度上得到了一些研究，并取得了一些相应的结果。本文正是在已有研究的基础上，对偏k -树的松弛竞赛色数进行了进一步的研究，使得在松弛度d不小于2k + 1的情况下，对这个( r ， d ) -松弛竞赛染色，有，它是文章[ 2 ]中结果的一个很好的改进。