field of graph theory, a core is a notion that describes behavior of a graph with respect to graph homomorphisms. Graph C {\displaystyle C} is a core if every...

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

In graph theory, a k-degenerate graph is an undirected graph in which every subgraph has at least one vertex of degree at most k {\displaystyle k} . That...

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...

discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential...

bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the...

In graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are...

can improve upon Core (graph theory), the homomorphically minimal subgraph of a graph Core (group theory), an object in group theory Core of a triangulated...

In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every...

A call graph (also known as a call multigraph) is a control-flow graph, which represents calling relationships between subroutines in a computer program...

"second Russia". World-systems theory Core countries Semi-periphery countries Periphery countries Degeneracy (graph theory) Rama, J.; Hall, J. (2021). "Raúl...

random graphs Fractal – Infinitely detailed mathematical structure Giant component – Large connected component of a random graph Graph theory – Area of...

In graph theory, multiple edges (also called parallel edges or a multi-edge), are, in an undirected graph, two or more edges that are incident to the same...

mathematics, the supersingular isogeny graphs are a class of expander graphs that arise in computational number theory and have been applied in elliptic-curve...

In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position...

application of the theories and algorithms of graph theory and is a form of proximity analysis. The applicability of graph theory to geographic phenomena...

current reality tree is a directed graph. A CRT is a focusing procedure formulated by Eliyahu Goldratt, developer of the theory of constraints. This process...

In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most...

In graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors. It...

"Strategy-proofness and the strict core in a market with indivisibilities". International Journal of Game Theory. 23 (1): 75–83. doi:10.1007/BF01242849...

A graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges, and properties to represent and store data. A key...

open source software. Several Python packages focusing on graph theory, including igraph, graph-tool, and numerous others, are available. As of April 2024...

combinatorial group theory, the Schreier coset graph is a graph associated with a group G, a generating set of G, and a subgroup of G. The Schreier graph encodes...

they are not abstract in the sense of the objects in graph 1 below. We might look at other graphs, in a progression from cat to mammal to animal, and see...

; Tanaka, R.; Doyle, J.C.; Willinger, W. (2005). "Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications (Extended Version)"...

Courcelle's theorem (graph theory) De Bruijn–Erdős theorem (graph theory) Dirac's theorems (graph theory) Erdős–Gallai theorem (graph theory) Erdős–Ginzburg–Ziv...

Brouwer fixed-point theorem Kakutani fixed-point theorem Nash equilibrium Core of Balanced Games Fisher market equilibria Arrow-Debreu equilibria Approximate...

unsatisfiable is called an unsatisfiable core of the original formula. Many SAT solvers can produce a resolution graph which proves the unsatisfiability of...

the mathematical field of graph theory, a truncated icosidodecahedral graph (or great rhombicosidodecahedral graph) is the graph of vertices and edges of...

pentagrammic prisms. In the mathematical field of graph theory, a rhombicosidodecahedral graph is the graph of vertices and edges of the rhombicosidodecahedron...