Definition 1. Assume that G（V, E, F）is a 3-connected plane graph. Remove all edges on the boundary of a face f<sub>0</sub> whose degree of all vertices of $ V（f-0）$ is 3 such that G becomes a tree T wh...Definition 1. Assume that G（V, E, F）is a 3-connected plane graph. Remove all edges on the boundary of a face f<sub>0</sub> whose degree of all vertices of $ V（f-0）$ is 3 such that G becomes a tree T whose degree of all vertices except those of V（f<sub>0</sub>） is at least 3. Then G is called a Halin-graph, f<sub>0</sub>展开更多
文摘Definition 1. Assume that G（V, E, F）is a 3-connected plane graph. Remove all edges on the boundary of a face f<sub>0</sub> whose degree of all vertices of $ V（f-0）$ is 3 such that G becomes a tree T whose degree of all vertices except those of V（f<sub>0</sub>） is at least 3. Then G is called a Halin-graph, f<sub>0</sub>
