Search Results for ""
1291 - 1300 of 2690 for Heawood Four Color GraphSearch Results
Gauge theory studies principal bundle connections, called gauge fields, on a principal bundle. These connections correspond to fields, in physics, such as an electromagnetic ...
A polygonal number and 6-polygonal number of the form n(2n-1). The first few are 1, 6, 15, 28, 45, ... (OEIS A000384). The generating function for the hexagonal numbers is ...
A polyhedron is said to be regular if its faces and vertex figures are regular (not necessarily convex) polygons (Coxeter 1973, p. 16). Using this definition, there are a ...
A square pyramid is a pyramid with a square base. It is a pentahedron. The lateral edge length e and slant height s of a right square pyramid of side length a and height h ...
Four circles may be drawn through an arbitrary point P on a torus. The first two circles are obvious: one is in the plane of the torus and the second perpendicular to it. The ...
Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...
A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...
The Floyd-Warshall algorithm, also variously known as Floyd's algorithm, the Roy-Floyd algorithm, the Roy-Warshall algorithm, or the WFI algorithm, is an algorithm for ...
Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...
Erdős and Rényi (1960) showed that for many monotone-increasing properties of random graphs, graphs of a size slightly less than a certain threshold are very unlikely to have ...
...
View search results from all Wolfram sites (28983 matches)

