Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Table of simple cubic graphs (view)

searching for Cubic graph 6 found (89 total)

Edge-transitive graph (515 words) [view diff] exact match in snippet view article find links to article

still not vertex-transitive, is called semi-symmetric. The Gray graph, a cubic graph on 54 vertices, is an example of a regular graph which is edge-transitive

Truncated tetrahedron (1,034 words) [view diff] exact match in snippet view article find links to article

Archimedean solids. It has 12 vertices and 18 edges. It is a connected cubic graph, and connected cubic transitive graph. It is also a part of a sequence

Pentagram (4,384 words) [view diff] exact match in snippet view article find links to article

Pentalpha – Puzzle involving stones and a pentagram Petersen graph – Cubic graph with 10 vertices and 15 edges Ptolemy's theorem – Relates the 4 sides

Regular map (graph theory) (1,090 words) [view diff] exact match in snippet view article

homomorphic image of a <2,m,n>-triangle group. Graph-theoretically, a map is a cubic graph Γ {\displaystyle \Gamma } with edges coloured blue, yellow, red such

Hamiltonian path problem (2,517 words) [view diff] case mismatch in snippet view article find links to article

Takuya (2007), Lin, Guohui (ed.), "An Improved Exact Algorithm for Cubic Graph TSP", Computing and Combinatorics, Lecture Notes in Computer Science

Any-angle path planning (1,981 words) [view diff] exact match in snippet view article find links to article

A* with an 8-connected discrete grid graph (2D; 26 for the 3D triple cubic graph) is very fast, but only looks at paths in 45-degree increments. This