Search Results for ""

A fork of a tree T is a node of T which is the endpoint of two or more branches.

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

A puzzle involving disentangling a set of rings from a looped double rod, originally used by French peasants to lock chests (Steinhaus 1999). The word "baguenaudier" means ...

An asymptotic direction at a point p of a regular surface M in R^3 is a direction in which the normal curvature of M vanishes. 1. There are no asymptotic directions at an ...

A ruled surface M is said to be a binormal developable of a curve y if M can be parameterized by x(u,v)=y(u)+vB^^(u), where B is the binormal vector.

The Costa surface is a complete minimal embedded surface of finite topology (i.e., it has no boundary and does not intersect itself). It has genus 1 with three punctures ...

The rotation vector of the trihedron of a curve with curvature kappa!=0 when a point moves along a curve with unit speed. It is given by D=tauT+kappaB, (1) where tau is the ...