1) outerplanar graphs
外可平面图
1.
This paper investigated the cycle base structures of 2-connected outerplanar graphs on the torus and proved that there is a one-to-one correspondence between the minimal cycle base and two nonhomotopic noncontractible cycles with the shortest total length when fw(G)≥2 and ew(G) > m, m = max{li | 1≤i≤f}(l1,…,lf denote the length of all the non-Hamilton facial walks of G).
研究环面上2-连通外可平面图G在嵌入Π的面宽fw(G)≥2时的圈基理论;给出在面宽fw(G)≥2和边宽ew(G)>m,m=max{li|1≤i≤f}时外可平面图G的最小圈基的结构,其中f记为Π的除Hamilton圈外的面迹数,l1,…,lf,为Π的对应面迹的长;并证明了G的最小圈基与其不同伦的两条长度之和最短的不可收缩圈之间存在一一对应。
2.
In this paper,we investigate the cycle bases structure of 2-connected outerplanar graphs on the plane and the projective plane in the case of ew(G)≥5.
在ew(G)≥5的条件下,研究在平面和射影平面上2-连通的外可平面图的圈基结构,给出在这两种平面上嵌入的最小圈基。
3.
In this paper, we investigate cycle base structures of 2-connected graphs on the projective plane and determine the minimum cycle base structure of 2-connected outerplanar graphs in the case of ew(G)≥5.
研究了射影平面上2 连通图的圈基结构,并给出了在嵌入的边宽度ew(G)≥5时外可平面图的最小圈基结构,证明了最小圈基与最短不可收缩圈之间的一一对应性。
2) Maximal out-planar graph
极大外可平面图
3) maximal outerplanar graph
最大外可平面图
4) planar graph
可平面图
1.
A note on 3-list-coloring of planar graphs
关于可平面图的3-列表染色的一个注记
2.
It not only tests a planar graph but also embeds the planar graph on a single line.
该算法不仅能够测试可平面图、寻找非平面图的最大可平面子图 ,而且能够把一个可平面图嵌入在一条直线上 。
3.
In this paper,we use the discharging method to prove that every planar graph with neither 4-,6-and 8-cycles nor triangles at distance less than 2 is 3-choosable.
本文运用Discharging方法证明了每一个不含4,6,8圈且任意两个三角形的距离至少为2的可平面图是3可选择的。
5) outerplanar graph
外平面图
1.
The degree-constrained k-arboricity of outerplanar graphs;
外平面图度有限制的k-荫度
2.
The vertex arboricity of the square of an outerplanar graph;
外平面图的平方图的点荫度
6) outerplanar graphs
外平面图
1.
In this paper,we study the undirected minimum-cardinality feedback vertex set problem in outerplanar graphs and present a polynomial time algorithm to solve it.
本文讨论外平面图的反馈点集并给出了一个求外平面图最小反馈点集的多项式时间算法。
2.
In thispaper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.
本文主要考虑外平面图中的反馈点集并给出了一个求外平面图最小顶点赋权反馈点集的线性时间算法。
3.
In this paper we prove that the problem is polynomial solvable on several special classes of graphs, such as outerplanar graphs, series-parallel graphs and Eulerian planar graphs.
主要考虑外平面图 ,系列平行图和平面欧拉图这三类特殊的平面图 。
补充资料：外亥姆霍兹平面
分子式：
CAS号：
性质：电极界面电解液一侧紧密双层中由非特性吸附离子(通常是溶剂化的)的电荷中心形成的平面。
CAS号：
性质：电极界面电解液一侧紧密双层中由非特性吸附离子(通常是溶剂化的)的电荷中心形成的平面。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条