Graph which can be made planar by removing a single node
An apex graph. The subgraph formed by removing the red vertex is planar.
In graph theory, a branch of mathematics, an apex graph is a graph that can be made planar by the removal of a single vertex. The deleted vertex is called an apex of the graph. It is an apex, not the apex because an apex graph may have more than one apex; for example, in the minimal nonplanar graphs K5 or K3,3, every vertex is an apex. The apex graphs include graphs that are themselves planar, in which case again every vertex is an apex. The null graph is also counted as an apex graph even though it has no vertex to remove.
Apex graphs are closed under the operation of taking minors and play a role in several other aspects of graph minor theory: linkless embedding,[1] Hadwiger's conjecture,[2] YΔY-reducible graphs,[3] and relations between treewidth and graph diameter.[4]
^Cite error: The named reference linkless was invoked but never defined (see the help page).
^Robertson, Seymour & Thomas (1993a).
^Cite error: The named reference t92 was invoked but never defined (see the help page).
^Cite error: The named reference local was invoked but never defined (see the help page).
an apex of the graph. It is an apex, not the apex because an apexgraph may have more than one apex; for example, in the minimal nonplanar graphs K5 or...
peroxide Apex (geometry), the highest vertex in a polyhedron or the point where the two equal sides of an isosceles triangle meet Apexgraph, a graph that...
linklessly embeddable graphs have the Petersen family graphs as their forbidden minors, and include the planar graphs and apexgraphs. They may be recognized...
triangle. apex 1. An apexgraph is a graph in which one vertex can be removed, leaving a planar subgraph. The removed vertex is called the apex. A k-apex graph...
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect...
K6-minor-free graph is an apexgraph Does a Moore graph with girth 5 and degree 57 exist? Do there exist infinitely many strongly regular geodetic graphs, or any...
In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges, vertices and by contracting edges...
may also be called the apex of the cone. However, this terminology conflicts with the terminology of apexgraphs, in which an apex is a vertex whose removal...
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to...
graph. As a Möbius ladder, the Wagner graph is nonplanar but has crossing number one, making it an apexgraph. It can be embedded without crossings on...
In graph theory, the treewidth of an undirected graph is an integer number which specifies, informally, how far the graph is from being a tree. The smallest...
planar graphs, extensions of these results have been proven for graphs of bounded genus, graphs with a forbidden minor that is an apexgraph, bounded-degree...
In mathematics, the graph structure theorem is a major result in the area of graph theory. The result establishes a deep and fundamental connection between...
In graph theory, the Petersen family is a set of seven undirected graphs that includes the Petersen graph and the complete graph K6. The Petersen family...
eight-vertex Wagner graph. The graphs with Hadwiger number at most five include the apexgraphs and the linklessly embeddable graphs, both of which have...
planar graphs, map graphs, bounded-genus graphs and graphs excluding any fixed minor. In particular, bidimensionality theory builds on the graph minor...
cells, respectively. In the mathematical field of graph theory, a cuboctahedral graph is the graph of vertices and edges of the cuboctahedron, one of...
mathematical language, a cuboid is a convex polyhedron whose polyhedral graph is the same as that of a cube. A special case of a cuboid is a rectangular...
closestly approches the pole of a sphare Vertex (graph theory), the fundamental unit of which graphs are formed Vertex (topography), in a triangulated...
forms a graph, with 4 vertices, and 6 edges. It is a special case of the complete graph, K4, and wheel graph, W4. It is one of 5 Platonic graphs, each a...
Barrages, the first modern irrigation structure across the Nile, located at the apex of the Nile Delta. In the mid 1850s, when Viceroy Sa'id Pasha took over project...
consist of three different graphs: flow-density, speed-flow, and speed-density. The graphs are two dimensional graphs. All the graphs are related by the equation...
In graph theory, a planar cover of a finite graph G is a finite covering graph of G that is itself a planar graph. Every graph that can be embedded into...
octahedron on the base and 8 triangular pyramid cells which meet at the apex. Since an octahedron has a circumradius divided by edge length less than...
Global Information