出典:Wikipedia
出典:『Wikipedia』 (2011/05/20 21:52 UTC 版)
In graph theory, an undirected graph is an outerplanar graph if it can be drawn in the plane without crossings in such a way that all of the vertices belong to the unbounded face of the drawing. Alternatively, a graph G is outerplanar if the graph formed from G by adding a new vertex, with edges connecting it to all the other vertices, is a planar graph.
| ・outerplanar graph | |
| ・Wireless USB | |
| ・Chott | |
| ・Cei | |
| ・Gohn | |
| ・Save Up | |
| ・aF | |
| ・microphon usage | |
| ・SYMPOSIUM | |
| ・suleri |