In graph theory, a tournament is a directed graph with exactly one edge between each two vertices, in one of the two possible directions. Equivalently...

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 mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed...

In graph theory, an orientation of an undirected graph is an assignment of a direction to each edge, turning the initial graph into a directed graph. A...

of the Middle Ages Tournament (solitaire), a solitaire card game Tournament (graph theory), a kind of directed graph The Tournament (TV series), a 2005–06...

the number theory of quadratic residues, and have interesting properties that make them useful in graph theory more generally. Paley graphs are named after...

In the mathematical study of graph theory, a pancyclic graph is a directed graph or undirected graph that contains cycles of all possible lengths from...

mathematics In graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G. A k-factor of a graph is a spanning...

Pearls in Graph Theory: A Comprehensive Introduction is an undergraduate-level textbook on graph theory by Nora Hartsfield and Gerhard Ringel. It was...

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

A tournament solution is a function that maps an oriented complete graph to a nonempty subset of its vertices. It can informally be thought of as a way...

In graph theory and graph algorithms, a feedback arc set or feedback edge set in a directed graph is a subset of the edges of the graph that contains at...

balanced tournament design of order n (a BTD(n)) Tournament (graph theory), mathematical model of a round-robin tournament McMahon system tournament, a variation...

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

the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly...

specifically in graph theory, a polytree (also called directed tree, oriented tree or singly connected network) is a directed acyclic graph whose underlying...

In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with...

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

a universal graph is an infinite graph that contains every finite (or at-most-countable) graph as an induced subgraph. A universal graph of this type...

specifically graph theory. Thomassen received his Ph.D. in 1976 from the University of Waterloo. He is editor-in-chief of the Journal of Graph Theory and the...

areas of spectral graph theory, extremal graph theory and random graphs, in particular in generalizing the Erdős–Rényi model for graphs with general degree...

In graph theory, the Gallai–Hasse–Roy–Vitaver theorem is a form of duality between the colorings of the vertices of a given undirected graph and the orientations...

In graph theory, an acyclic orientation of an undirected graph is an assignment of a direction to each edge (an orientation) that does not form any directed...

In graph theory, a branch of mathematics, a Hamiltonian decomposition of a given graph is a partition of the edges of the graph into Hamiltonian cycles...

its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. To...

number Berlekamp switching game Salem–Spencer set Secretary problem Tournament (graph theory) Erdős distinct distances problem Leo Moser at the Mathematics...

In graph theory, oriented graph coloring is a special type of graph coloring. Namely, it is an assignment of colors to vertices of an oriented graph that...

Are graphs uniquely determined by their subgraphs? More unsolved problems in mathematics Informally, the reconstruction conjecture in graph theory says...

– Graph Theory and Combinatorics, University of Illinois, retrieved 2025-05-11 Dean, Nathaniel; Latka, Brenda J. (1995), "Squaring the tournament—an...

In graph theory, the shift graph Gn,k for n , k ∈ N ,   n > 2 k > 0 {\displaystyle n,k\in \mathbb {N} ,\ n>2k>0} is the graph whose vertices correspond...