Search results
Jump to navigation
Jump to search
Page title matches
- '''Graph theory''' is the field of mathematics which deals with the study of '''graphs'''.3 KB (478 words) - 08:09, 8 June 2009
- 124 bytes (17 words) - 17:56, 4 August 2008
- 81 bytes (10 words) - 16:46, 4 August 2010
- 87 bytes (11 words) - 17:48, 6 January 2009
- Auto-populated based on [[Special:WhatLinksHere/Graph theory]]. Needs checking by a human.797 bytes (101 words) - 16:58, 11 January 2010
Page text matches
- {{r|Graph theory}}236 bytes (31 words) - 11:34, 19 April 2010
- ...disciplines within mathematics that study discrete objects: combinatorics, graph theory, number theory, mathematical logic, …167 bytes (18 words) - 09:28, 18 June 2009
- #REDIRECT [[Graph theory]]26 bytes (3 words) - 14:36, 3 November 2008
- * A combinatorial structure of vertices and edges studied in [[graph theory]]252 bytes (33 words) - 12:51, 31 May 2009
- ...], generally in an angle, polygon or polyhedron. Vertices appear also in [[graph theory]] as basic elements of a [[graph]]. In this context vertices are often call335 bytes (50 words) - 03:10, 8 March 2024
- Auto-populated based on [[Special:WhatLinksHere/Graph theory]]. Needs checking by a human.797 bytes (101 words) - 16:58, 11 January 2010
- Branch of Graph theory which studies seemingly orderless systems and analyses the conditions under163 bytes (22 words) - 06:41, 20 November 2011
- ...the Hungarian-American mathematician Paul Erdős and are an application of graph theory, a field in which he published extensively.177 bytes (25 words) - 09:28, 19 November 2011
- {{r|Graph theory}}245 bytes (29 words) - 09:38, 18 June 2009
- {{r|Forest (graph theory)}}64 bytes (8 words) - 16:46, 4 August 2010
- '''Graph theory''' is the field of mathematics which deals with the study of '''graphs'''.3 KB (478 words) - 08:09, 8 June 2009
- '''Ramsey Theory''' is a branch of [[Graph theory]] which studies seemingly orderless systems and analyses the conditions und968 bytes (163 words) - 05:01, 1 November 2013
- {{r|Graph theory}}610 bytes (72 words) - 10:57, 18 June 2009
- === An example from graph theory === Proposition: A [[tree (graph theory)|tree]] in [[graph theory]] has [[euler characterist|Euler characteristic]] −1.3 KB (480 words) - 16:53, 10 November 2007
- ;: [[Neighborhood (graph theory)]]384 bytes (46 words) - 01:43, 9 February 2024
- In [[graph theory]], the '''Tutte matrix''' <math>A</math> of a [[Graph (mathematics)|graph]]2 KB (259 words) - 17:10, 28 October 2008
- {{r|Graph theory}}341 bytes (42 words) - 14:19, 1 December 2010
- * [[Forest]]s in a [[Graph theory|graph]].2 KB (334 words) - 16:29, 7 February 2009
- {{r|Graph theory}}1 KB (144 words) - 00:13, 21 January 2011
- {{r|Graph theory}}430 bytes (56 words) - 21:08, 11 January 2010
- {{r|Graph theory}}551 bytes (71 words) - 18:22, 11 January 2010
- {{r|Graph theory}}2 KB (262 words) - 19:07, 11 January 2010
- {{r|Graph theory}}590 bytes (76 words) - 16:02, 11 January 2010
- ...nce|Computer Science]], '''register allocation by graph coloring''' is a [[graph theory|graph theoretic]] solution to the [[register allocation]] problem.9 KB (1,338 words) - 10:00, 16 July 2013
- In [[graph theory]], '''graph coloring''' is an arbitrary assignment of labels (''colors'') t ...early always assumed to be '''proper''', meaning that no two [[glossary of graph theory|adjacent]] vertices are assigned the same color.14 KB (2,315 words) - 00:35, 9 February 2010
- ...ungarian-American mathematician [[Paul Erdős]] and are an application of [[graph theory]], a field in which he published extensively. They treat collaboration amon2 KB (370 words) - 12:51, 11 February 2013
- ...branches are [[algebraic combinatorics]] and [[extremal combinatorics]]. [[Graph theory]] is sometimes also considered a part of combinatorics.1 KB (165 words) - 10:24, 18 June 2009
- ...hematics, operations research, and decision making. Their subjects include graph theory and its applications, nonlinear mathematics, analytical planning, and game3 KB (359 words) - 11:52, 13 February 2009
- Robert Tarjan is known for his pioneering work on graph theory algorithms and data structures. Some of his well-known algorithms include t5 KB (696 words) - 22:43, 11 February 2010
- </ref>. It is related to mathematical [[Graph Theory]].5 KB (792 words) - 16:47, 2 August 2008
- ...ve important applications to [[number theory]], [[arithmetic geometry]], [[graph theory]], and [[dynamical systems]], to name a few examples. The Riemann zeta fun7 KB (1,113 words) - 10:50, 4 October 2013
- ...of the complex XML data struture, without having to traverse the complex [[graph theory|tree]] that makes up XML document.5 KB (741 words) - 18:36, 12 August 2008
- ...onised the formal technology available to modal logicians and gave a new [[graph theory|graph-theoretic]] way of looking at modality that has driven many applicati32 KB (4,979 words) - 21:47, 12 November 2011
- | [[Combinatorics]] || [[Theory of computation]] || [[Cryptography]] || [[Graph theory]]30 KB (4,289 words) - 16:03, 20 January 2023
- ...mics]] <ref>e.g. Grindrod P, Kibble M (2004) Review of uses of network and graph theory concepts within proteomics ''Expert Rev Proteomics'' 1:229-38 PMID 1596681730 KB (4,597 words) - 01:37, 29 October 2013
- ...mistry]]''' are [[Statistical physics]], [[Statistical thermodynamics]], [[Graph theory]], [[Group Theory]], [[Monte Carlo simulations]], [[Scaling theory]], [[Phy36 KB (5,455 words) - 11:49, 6 September 2013
- ...mistry]]''' are [[Statistical physics]], [[Statistical thermodynamics]], [[Graph theory]], [[Group Theory]], [[Monte Carlo simulations]], [[Scaling theory]], [[Phy36 KB (5,455 words) - 08:57, 12 September 2013
- ...omics]]<ref>e.g. Grindrod P, Kibble M (2004) Review of uses of network and graph theory concepts within proteomics. Expert Rev Proteomics 1:229-38 PMID 15966817</r47 KB (6,881 words) - 10:00, 14 July 2015
- ...a. What makes it unique from other kinds of [[statistics]] is the use of [[graph theory]] and [[Matrix (mathematics)|matrix algebra]] to reduce the number of param41 KB (6,343 words) - 17:02, 22 March 2024
- ...mics]] <ref>e.g. Grindrod P, Kibble M (2004) Review of uses of network and graph theory concepts within proteomics. Expert ''Rev Proteomics'' 1:229-38 PMID 159668194 KB (13,588 words) - 18:21, 24 November 2013
- ...mics]] <ref>e.g. Grindrod P, Kibble M (2004) Review of uses of network and graph theory concepts within proteomics. ''Expert Rev Proteomics'' 1:229-38 PMID 1596681150 KB (22,449 words) - 05:42, 6 March 2024
- ...mics]],<ref>e.g. Grindrod P, Kibble M (2004) Review of uses of network and graph theory concepts within proteomics. ''Expert Rev Proteomics'' 1:229-38 PMID 1596681194 KB (28,649 words) - 05:43, 6 March 2024