Search Results for ""
171 - 180 of 423 for Hamiltonian CyclesSearch Results
View search results from all Wolfram sites (2502 matches)A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...
A sequence produced by the instructions "reverse, add to the original, then sort the digits." For example, after 668, the next iteration is given by 668+866=1534, so the next ...
The disdyakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis dodecahedron. It is implemented in the Wolfram Language as ...
The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...
Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 and m=2,3, but only a small ...
A Halin graph, sometimes known as a roofless polyhedron, is a polyhedral graph constructed from a planar embedding of a tree having four or more vertices, no vertices of ...
The pentagonal hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron. It is implemented in the Wolfram Language as ...
The pentagonal icositetrahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal icositetrahedron. It is implemented in the Wolfram Language as ...
The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...
The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...
...