nonplanar
Look at other dictionaries:
Nonplanar electrophotographic plate — Неплоская электрофотографическая пластина … Краткий толковый словарь по полиграфии
Multigate device — A multigate device or multiple gate field effect transistor(MuGFET) refers to a MOSFET which incorporates more than one gate into a single device. The multiple gates may be controlled by a single gate electrode, wherein the multiple gate surfaces … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
hydrocarbon — hydrocarbonaceous, adj. /huy dreuh kahr beuhn, huy dreuh kahr /, n. any of a class of compounds containing only hydrogen and carbon, as an alkane, methane, CH4, an alkene, ethylene, C2H4, an alkyne, acetylene, C2H2, or an aromatic compound,… … Universalium
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Infinite skew polyhedron — In geometry, infinite skew polyhedra are an extended definition of polyhedra, created by regular polygon faces, and nonplanar vertex figures.Many are directly related to a convex uniform honeycomb, being the polygonal surface of a honeycomb with… … Wikipedia
Möbius ladder — Two views of the Möbius ladder M16. In graph theory, the Möbius ladder Mn is a cubic circulant graph with an even number n of vertices, formed from an n cycle by adding edges (called rungs ) connecting opposite pairs of vertices in the cycle. It… … Wikipedia
Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… … Wikipedia
Planarity testing — In graph theory, the planarity testing problem asks whether, given a graph, that graph is a planar graph (can be drawn in the plane without edge intersections). This is a well studied problem in computer science for which many practical… … Wikipedia
