TOPICS
Search

Search Results for ""


1331 - 1340 of 2059 for Star GraphSearch Results
A polyhedron compound is an arrangement of a number of interpenetrating polyhedra, either all the same or of several distinct types, usually having visually attractive ...
There are four fully supported stellations of the rhombic dodecahedron including as usual the original solid in the count (Wells 1991; Webb). The three nontrivial ones ...
A variable is a symbol on whose value a function, polynomial, etc., depends. For example, the variables in the function f(x,y) are x and y. A function having a single ...
A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.
A Ramsey number of the form R(k,k;2).
Edge splitting is the reverse of edge contraction.
An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).
The problem of deciding if four colors are sufficient to color any map on a plane or sphere.
As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.
The Parts graphs are a set of unit-distance graphs with chromatic number five derived by Jaan Parts in 2019-2020 (Parts 2020a). They provide some of the smallest known ...
1 ... 131|132|133|134|135|136|137 ... 206 Previous Next

...