mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each...

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...

dual. The dual graph depends on how the primal graph is embedded: different planar embeddings of a single graph may lead to different dual graphs. Matroid...

form a graph embedded on this surface, and the vertices and edges of the (abstract) dual polyhedron form the dual graph of the original graph. An abstract...

used for the line graph include the covering graph, the derivative, the edge-to-vertex dual, the conjugate, the representative graph, and the θ-obrazom...

graphs, named after Hassler Whitney. It states that a graph G is planar if and only if its graphic matroid is also cographic (that is, it is the dual...

from the similarly-named notions of a dual polyhedron, and of the dual graph of a surface-embedded graph. Dual graphs have also been used to define and study...

In graph theory, an outerplanar graph is a graph that has a planar drawing for which all vertices belong to the outer face of the drawing. Outerplanar...

useful graph that is often associated with a triangulation of a polygon P is the dual graph. Given a triangulation TP of P, one defines the graph G(TP)...

as: edge contraction, line graph, dual graph, complement graph, graph rewriting; binary operations, which create a new graph from two initial ones, such...

The join graphs and join trees of a constraint satisfaction problem are graphs representing its dual problem or a problem obtained from the dual problem...

hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two...

the sink of an st-planar graph back to the source, through the outer face, and then constructs the dual graph (oriented each dual edge clockwise with respect...

In topological graph theory, the Petrie dual of an embedded graph (on a 2-manifold with all faces disks) is another embedded graph that has the Petrie...

every wheel graph is a Halin graph. They are self-dual: the planar dual of any wheel graph is an isomorphic graph. Every maximal planar graph, other than...

Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...

just a vertex coloring of its line graph, and a face coloring of a plane graph is just a vertex coloring of its dual. However, non-vertex coloring problems...

other. The dual of a graph can be found entirely by a graphical method. The dual of a graph is another graph. For a given tree in a graph, the complementary...

In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (that...

In science and engineering, a log–log graph or log–log plot is a two-dimensional graph of numerical data that uses logarithmic scales on both the horizontal...

of graph; dual graph; medial graph; quotient graph; Y-Δ transform; Mycielskian. Binary operations create a new graph from two initial graphs G1 = (V1,...

the orientable surface of genus 3, in which they form dual graphs. This is a 3-regular (cubic) graph with 56 vertices and 84 edges, named after Felix Klein...

In the mathematical field of graph theory, the Dyck graph is a 3-regular graph with 32 vertices and 48 edges, named after Walther von Dyck. It is Hamiltonian...

The dual graph of a directed graph, embedded in the plane, is a graph with a vertex for each face of the given graph, and a dual edge between two dual vertices...

In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability...

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...

In the mathematical area of graph theory, an undirected graph G is dually chordal if the hypergraph of its maximal cliques is a hypertree. The name comes...

mathematical field of graph theory, the Erdős–Rényi model refers to one of two closely related models for generating random graphs or the evolution of a...

the graph. Edge connectivity is the dual concept to girth, the length of the shortest cycle in a graph, in the sense that the girth of a planar graph is...

triangulation of a discrete point set P in general position corresponds to the dual graph of the Voronoi diagram for P. The circumcenters of Delaunay triangles...