At the same time,we determine the minimum cycle bases of them.
在ew(G)≥5的条件下,研究在平面和射影平面上2-连通的外可平面图的圈基结构,给出在这两种平面上嵌入的最小圈基。
Then we show that there is a one-one correspondence between minimum cycle bases and the shortest noncontractible cycles.
研究了射影平面上2 连通图的圈基结构,并给出了在嵌入的边宽度ew(G)≥5时外可平面图的最小圈基结构,证明了最小圈基与最短不可收缩圈之间的一一对应性。
Together with some basic knowledge of linear algebra,we prove that there exists a polynomial time algorithm for finding the minimum cycle bases of locally LEW-embedded graph.
利用Thomassen等人在大边宽嵌入方面的工作,给出局部大边宽嵌入的定义,并运用线性代数和相异代表系的知识,证明了局部大边宽嵌入图的最小圈基。
