language:
Find link is a tool written by Edward Betts.Longer titles found: Tree (graph theory) (view), Glossary of graph theory (view), Vertex (graph theory) (view), Connectivity (graph theory) (view), Degree (graph theory) (view), Distance (graph theory) (view), Path (graph theory) (view), Cycle (graph theory) (view), Clique (graph theory) (view), Independent set (graph theory) (view), Component (graph theory) (view), Girth (graph theory) (view), Loop (graph theory) (view), Neighbourhood (graph theory) (view), Matching (graph theory) (view), Cut (graph theory) (view), Journal of Graph Theory (view), Spectral graph theory (view), Star (graph theory) (view), Homeomorphism (graph theory) (view), Kőnig's theorem (graph theory) (view), Topological graph theory (view), Extremal graph theory (view), Algebraic graph theory (view), List of graph theory topics (view), Bridge (graph theory) (view), Chemical graph theory (view), Geometric graph theory (view), De Bruijn–Erdős theorem (graph theory) (view), Orientation (graph theory) (view), Crossing number (graph theory) (view), Snark (graph theory) (view), Cage (graph theory) (view), Arborescence (graph theory) (view), Hadwiger conjecture (graph theory) (view), Degeneracy (graph theory) (view), Dominator (graph theory) (view), Tournament (graph theory) (view), Cycle decomposition (graph theory) (view), Regular map (graph theory) (view), Conductance (graph theory) (view), Evolutionary graph theory (view), Cheeger constant (graph theory) (view), End (graph theory) (view), Graph Theory, 1736–1936 (view), Rank (graph theory) (view), Thickness (graph theory) (view), Book (graph theory) (view), Haven (graph theory) (view), Core (graph theory) (view), Dimension (graph theory) (view), Periodic graph (graph theory) (view), Nullity (graph theory) (view), Intersection number (graph theory) (view), Pearls in Graph Theory (view), Saturation (graph theory) (view), Split (graph theory) (view), Metric dimension (graph theory) (view), Bramble (graph theory) (view), Random graph theory of gelation (view)
searching for Graph theory 13 found (2578 total)
alternate case: graph theory
Game tree
(1,288 words)
[view diff]
no match in snippet
view article
find links to article
In the context of combinatorial game theory, a game tree is a graph representing all possible game states within a sequential game that has perfect informationKuo-Chen Chou (925 words) [view diff] no match in snippet view article find links to article
Kuo-Chen Chou (周国城; August 14, 1938–July 5, 2021) was a Chinese-American biophysicist and bioinformatician who founded the Gordon Life Science InstitutePrüfer sequence (983 words) [view diff] no match in snippet view article find links to article
In combinatorial mathematics, the Prüfer sequence (also Prüfer code or Prüfer numbers) of a labeled tree is a unique sequence associated with the treeKlein four-group (1,384 words) [view diff] no match in snippet view article find links to article
In mathematics, the Klein four-group is an abelian group with four elements, in which each element is self-inverse (composing it with itself produces theExpander mixing lemma (2,170 words) [view diff] case mismatch in snippet view article find links to article
185-191. Haemers, W. H. (1979). Eigenvalue Techniques in Design and Graph Theory (PDF) (Ph.D.). Haemers, W. H. (1995), "Interlacing Eigenvalues and Graphs"Variation (game tree) (265 words) [view diff] no match in snippet view article
A variation can refer to a specific sequence of successive moves in a turn-based game, often used to specify a hypothetical future state of a game thatTurán number (345 words) [view diff] exact match in snippet view article find links to article
gráfelméleti szélsőértékfeladatról (Hungarian. An extremal problem in graph theory.)", Mat. Fiz. Lapok (in Hungarian), 48: 436–452 Turán, P. (1961), "ResearchList of conjectures (1,461 words) [view diff] exact match in snippet view article find links to article
Erdős–Faber–Lovász conjecture graph theory Paul Erdős, Vance Faber, and László Lovász 172 Erdős–Gyárfás conjecture graph theory Paul Erdős and András GyárfásGraph partition (2,979 words) [view diff] no match in snippet view article find links to article
In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. EdgesWiener connector (1,129 words) [view diff] no match in snippet view article find links to article
In network theory, the Wiener connector is a means of maximizing efficiency in connecting specified "query vertices" in a network. Given a connected, undirectedGeneralized map (287 words) [view diff] no match in snippet view article find links to article
In mathematics, a generalized map is a topological model which allows one to represent and to handle subdivided objects. This model was defined startingL. W. Beineke (193 words) [view diff] exact match in snippet view article find links to article
Lowell Wayne Beineke (born 1939) is a professor of graph theory at Purdue University Fort Wayne. Beineke is known for his elegant characterization of lineList of lemmas (525 words) [view diff] no match in snippet view article find links to article
This following is a list of lemmas (or, "lemmata", i.e. minor theorems, or sometimes intermediate technical results factored out of proofs). See also list