Graph Theory

In graph theory, informally, the reconstruction conjecture says that graphs are determined uniquely by their subgraphs.

In graph theory, list edge-coloring is a type of graph coloring that combines list coloring and edge coloring.

In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some subset of the integers from 0

In graph theory, total coloring is a type of graph coloring on the vertices and edges of a graph.

In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices

In graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle.

In graph theory, an n-dimensional De Bruijn graph of m symbols is a directed graph representing overlaps between sequences of symb

In the mathematical discipline of graph theory, Petersen's theorem, named after Julius Petersen, is one of the earliest results in

In graph theory, a part of discrete mathematics, the BEST theorem gives a product formula for the number of Eulerian circuits in d

The five color theorem is a result from graph theory that given a plane separated into regions, such as a political map of the cou

tructure theorem is a major result in the area of graph theory.

In graph theory, Grinberg's theorem is a necessary condition for a planar graph to contain a Hamiltonian cycle, based on the lengt

In graph theory, an area of mathematics, an equitable coloring is an assignment of colors to the vertices of an undirected graph,

In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph.

In graph theory, the planar separator theorem is a form of isoperimetric inequality for planar graphs, that states that any planar

In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H f : V ( G ) → V ( H ) such tha

In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Per

In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itse

In graph theory, the graph bandwidth problem may be visualized as placing the vertices of a given graph at distinct integer positi

In graph theory, a branch of mathematics, the Moser spindle (also called the Mosers' spindle or Moser graph) is an undirected grap

nomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics.

In the mathematical field of algebraic graph theory, the degree matrix of an undirected graph is a diagonal matrix which contains

In graph theory, Vizing's conjecture concerns a relation between the domination number and the cartesian product of graphs.

Tuza's conjecture is an unsolved problem in graph theory, a branch of mathematics, concerning triangles in undirected graphs.

In graph theory, Hedetniemi's conjecture, formulated by Stephen T.

rk-Pham Theorem, was a conjecture in the field of graph theory and statistical mechanics, proposed by Jeff Kahn and Gil Kalai in 2

In graph theory, Ryser's conjecture is a conjecture relating the maximum matching size and the minimum transversal size in hypergr

re is a major conjecture in the field of extremal graph theory, posed by Alexander Sidorenko in 1986.

In graph theory, the Kneser graph K(n, k) (alternatively KGn,k) is the graph whose vertices correspond to the k-element subsets of

In graph theory, the handshaking lemma is the statement that, in every finite undirected graph, the number of vertices that touch

In the mathematical field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar, undirected grap

In graph theory, Wagner's theorem is a mathematical forbidden graph characterization of planar graphs, named after Klaus Wagner, s

In graph theory, Berge's theorem states that a matching M in a graph G is maximum (contains the largest possible number of edges)

In graph theory, the Nash-Williams theorem is a tree-packing theorem that describes how many edge-disjoint spanning trees (and mor

In graph theory and polyhedral combinatorics, areas of mathematics, Kotzig's theorem is the statement that every polyhedral graph

In graph theory, approximate max-flow min-cut theorems concern the relationship between the maximum flow rate (max-flow) and the m

In graph theory, Schnyder's theorem is a characterization of planar graphs in terms of the order dimension of their incidence pose

In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the

In graph theory, the treewidth of an undirected graph is an integer number which specifies, informally, how far the graph is from

(ETT), named after Leonhard Euler, is a method in graph theory for representing trees.

In graph theory, betweenness centrality is a measure of centrality in a graph based on shortest paths.

graph theory

graph theory

graph theory

Tietze's graph

graph theory