Search results

In graph theory, a branch of mathematics, a map graph is an undirected graph formed as the intersection graph of finitely many simply connected and internally...

topology and graph theory, a map is a subdivision of a surface such as the Euclidean plane into interior-disjoint regions, formed by embedding a graph onto the...

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

In topological graph theory, a graph-encoded map or gem is a method of encoding a cellular embedding of a graph using a different graph with four vertices...

graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject...

Regular maps are typically defined and studied in three ways: topologically, group-theoretically, and graph-theoretically. Topologically, a map is a 2-cell...

In topological graph theory, an embedding (also spelled imbedding) of a graph G {\displaystyle G} on a surface Σ {\displaystyle \Sigma } is a representation...

the vertex sets of two graphs that maps adjacent vertices to adjacent vertices. Homomorphisms generalize various notions of graph colorings and allow the...

idiom in parallel computing Map (mathematics), generalizations of the concept of function Map (graph theory), a drawing of a graph on a surface without overlapping...

if the graph changes over time by adding and deleting edges (dynamic graph drawing) and the goal is to preserve the user's mental map. Graphs are frequently...

Euler (1707–1783) Venn diagram (1880) by John Venn (1834–1923) Karnaugh map (1953) by Maurice Karnaugh The same methods of Boolean expression minimization...

mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context...

planar graph can be formed from a map in this way. In graph-theoretic terminology, the four-color theorem states that the vertices of every planar graph can...

knowledge graph is a knowledge base that uses a graph-structured data model or topology to represent and operate on data. Knowledge graphs are often used...

A conceptual graph (CG) is a formalism for knowledge representation. In the first published paper on CGs, John F. Sowa used them to represent the conceptual...

the definition above maps one edge to another, a symmetric graph must also be edge-transitive. However, an edge-transitive graph need not be symmetric...

The functions that retrieve and map the data are called resolvers. After being validated against the schema, a GraphQL query is executed by the server...

mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood. The graph is cubic, and...

quotient graph corresponds to the graph induced on the quotient set V/R of its vertex set V. Further, there is a graph homomorphism (a quotient map) from...

the mathematical discipline of graph theory, a graph C is a covering graph of another graph G if there is a covering map from the vertex set of C to the...