Search results

{{infobox graph | name = Lollipop graph ...

{{Short description|Graph drawing using eigenvector coordinates}} [[File:Spectral graph drawing of small world graph.svg|thumb|179x179px|Spectral layout drawing of random [[small-world network ...

{{short description|Graph data structure}} ...web|url=https://www.khanacademy.org/computing/computer-science/algorithms/graph-representation/a/representing-graphs|title=Representing graphs|website=Khan ...

...ce.wiley.com/journal/113386917/abstract?CRETRY=1&SRETRY=0 Bibliography on Graph equations ]</ref> ...G'' and ''H'' such that the [[line graph]] of ''G'' is same as the [[total graph]] of ''H''? (What are ''G'' and ''H'' such that ''L''(''G'') = '' T''(''H' ...

...is case, 22 <math>></math> 20.]]{{unsolved|mathematics|'''Conjecture:''' A graph ''G'' with <math>\Delta (G) > n/3</math> is class 2 [[if and only if]] it h ...lows. An alternate, stricter definition of an overfull subgraph ''S'' of a graph ''G'' requires <math>\displaystyle\Delta (G) = \Delta (S)</math>. ...

[[File:Urquhart graph.svg|right|300px|thumb|Example of '''Urquhart graph''': the (thin cyan) longest edges are removed from each Delaunay triangle.] In [[computational geometry]], the '''Urquhart graph''' of a set of points in the plane, named after Roderick B. Urquhart, is ob ...

{{Short description|Graph theory algorithms}} ...]s. Kleitman and Wang <ref>{{harvtxt|Kleitman|Wang|1973}}</ref> gave these algorithms in 1973. ...

...set of [[edge (graph theory)|edge]]s which is incident with each [[vertex (graph theory)|vertex]] exactly once. ...d is a generalisation of the [[Edmonds matrix]] for a balanced [[bipartite graph]]. ...

{{Short description|Undirected graph with graph distances linearly bounded w.r.t. Euclidean distances}} [[File:Yao graph.svg|thumb|right|200px]] ...

...ts on the edges (which may be positive or negative or zero) has a [[Cycle (graph theory)|cycle]] in which the sum of weights is&nbsp;0. [[File:Zero weight cycle.svg|thumb|A graph with a zero-weight cycle.]] ...

...t algorithm for quality 2-dimensional mesh generation | journal=Journal of Algorithms | year=1995 | issue=3 | pages= 548–585 | volume=18}}</ref> | alt2 = Planar straight line graph-based definition. ...

{{Short description|Distance of a graph from a split graph}} ...with a [[clique (graph theory)|clique]] in blue and an [[independent set (graph theory)|independent set]] in red. ...

{{Short description|Algorithm for graph coloring}} ...979.<ref name=":0">{{Cite journal|last=Leighton|first=F.|date=1979|title=A graph coloring algorithm for large scheduling problems|journal=Journal of Researc ...

In [[graph theory]], the '''rectilinear minimum spanning tree''' ('''RMST''') of a set ==Properties and algorithms== ...

...The problem asks whether a given list of pairs can be used to construct a graph, and for the list above, the answer is yes.]] ...v_i</math> has [[directed graph|indegree]] <math>a_i</math> and [[directed graph|outdegree]] <math>b_i</math>. ...

...versal of size 2: removing the two blue bottom vertices leaves a bipartite graph.]] ...the vertices of an odd cycle transversal from a graph leaves a [[bipartite graph]] as the remaining [[induced subgraph]].{{r|pa}} ...

|data=[[Graph (data structure)|Graph]] ...ns multiple tour fragments, each of which is a simple path in the complete graph of cities. At each stage, the algorithm selects the edge of minimal cost th ...

{{short description|Graph colouring algorithm by Daniel Brélaz}} |class = [[Graph coloring]] <!-- Name of problem it solves --> ...

...ear decompositions of matching-covered graphs|journal=ACM Transactions on Algorithms|volume=1|issue=2|pages=324–337|doi=10.1145/1103963.1103969|issn=1549-6325}} ...impler problem of finding a ''single'' maximum matching in ''G''). Several algorithms for this problem are known. ...

...r science]]. In all of these problems one is given a collection of [[Tree (graph theory)|trees]] <math>T_1,\ldots, T_m</math> each containing <math>n</math> ...um Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms|journal=SIAM Journal on Computing|volume=26|issue=6|pages=1656–1669|doi=10. ...