Search Results for ""

A graph corresponding to the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, all of which are regular, planar, polyhedral, and Hamiltonian. The ...

There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...

A number taken to the power 3 is said to be cubed, so x^3 is called "x cubed." This terminology derives from the fact that the volume of a cube of edge length x is given by ...

A pivot point of a curve is a fixed point Q such that points P lying on the curve and their (isogonal, isotomic, etc.) conjugates are collinear with Q.

The Gibert point can be defined as follows. Given a reference triangle DeltaABC, reflect the point X_(1157) (which is the inverse point of the Kosnita point in the ...

A general plane quartic curve is a curve of the form (1) Examples include the ampersand curve, bean curve, bicorn, bicuspid curve, bifoliate, bifolium, bitangent-rich curve, ...

Tutte (1971/72) conjectured that there are no 3-connected nonhamiltonian bicubic graphs. However, a counterexample was found by J. D. Horton in 1976 (Gropp 1990), and several ...

A planar hypohamiltonian graph is a hypohamiltonian graph that is also planar. A number of planar hypohamiltonian graphs are illustrated above. Chvátal (1973) first asked if ...