Explore: Complete Graphs

Kuratowski to graph theory. Kn has n(n − 1)/2 edges (a triangular number), and is a regular graph of degree n − 1. All complete graphs are their own maximal

k-partite graphs and graphs that avoid larger cliques as subgraphs in Turán's theorem, and these two complete bipartite graphs are examples of Turán graphs, the

otherwise, graphs are finite, undirected graphs with loops allowed, but multiple edges (parallel edges) disallowed. A graph homomorphism f  from a graph G =

Planar graphs (In fact, planar graph isomorphism is in log space, a class contained in P) Interval graphs Permutation graphs Circulant graphs Bounded-parameter

In graph theory, a branch of mathematics, the disjoint union of graphs is an operation that combines two or more graphs to form a larger graph. It is

associated to the graph, such as the Colin de Verdière number. Two graphs are called cospectral or isospectral if the adjacency matrices of the graphs are isospectral

orientation of an undirected complete graph. (However, as directed graphs, tournaments are not complete: complete directed graphs have two edges, in both directions

graph is a forest. More advanced kinds of graphs are: Petersen graph and its generalizations; perfect graphs; cographs; chordal graphs; other graphs with

a plane graph has an external or unbounded face, none of the faces of a planar map has a particular status. Planar graphs generalize to graphs drawable

{\displaystyle 1\leq \chi (G)\leq n.} The only graphs that can be 1-colored are edgeless graphs. A complete graph K n {\displaystyle K_{n}} of n vertices requires