field of graph theory, the Horton graph or Horton 96-graph is a 3-regular graph with 96 vertices and 144 edges discovered by Joseph Horton. Published...

of graph theory, the Ellingham–Horton graphs are two 3-regular graphs on 54 and 78 vertices: the Ellingham–Horton 54-graph and the Ellingham–Horton 78-graph...

of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3-regular graph. Cubic graphs are...

graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Holt graph Horton graph...

cubic 3-connected bipartite graph is Hamiltonian. Horton disproved the conjecture some years earlier with the Horton graph, but that was larger at 92 vertices...

4-cycle. John Horton Conway offered a $1000 prize for its solution. If such a graph exists, it would necessarily be a locally linear graph and a strongly...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

Genius At Play: The Curious Mind of John Horton Conway Nature, 23 July 2015 A question related to Conways 99 graph problem MathOverflow Conway, J.H. and...

Ruth Ellingham, Martin's aunt in the series Ellingham diagram Ellingham–Horton graph This disambiguation page lists articles associated with the title Ellingham...

3-connected bipartite graph is Hamiltonian, but this was shown to be false by the discovery of a counterexample, the Horton graph. David W. Barnette (1969)...

Conway's 99-graph problem asks for the construction of an srg(99, 14, 1, 2). It is unknown whether a graph with these parameters exists, and John Horton Conway...

of areas in a line drawing according to the rules of graph coloring. With each move, the graph must remain proper (no two areas of the same colour may...

In graph theory, a branch of mathematics, a cycle basis of an undirected graph is a set of simple cycles that forms a basis of the cycle space of the...

graceful labeling? More unsolved problems in mathematics In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some...

In mathematics, the Strahler number or Horton–Strahler number of a mathematical tree is a numerical measure of its branching complexity. These numbers...

graph theory. With Joseph D. Horton, he is the discoverer and namesake of the Ellingham–Horton graphs, two cubic 3-vertex-connected bipartite graphs that...

In graph theory, a Halin graph is a type of planar graph, constructed by connecting the leaves of a tree into a cycle. The tree must have at least four...

Hackenbush is a two-player game invented by mathematician John Horton Conway. It may be played on any configuration of line segments connected to one another...

mathematics, discoverer and namesake of the Ellingham–Horton graphs, two cubic 3-vertex-connected bipartite graphs that have no Hamiltonian cycle James W. Ely Jr...

In graph theory, a locally linear graph is an undirected graph in which every edge belongs to exactly one triangle. Equivalently, for each vertex of the...

group J2. It happens that J2 acts as a permutation group on the Hall–Janko graph of 100 points, the stabilizer of one point being a subgroup with two other...

(the heaps). The evolution graph of the game of nim with three heaps is the same as three branches of the evolution graph of the Ulam–Warburton automaton...

Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is a zero-player game, meaning that its evolution is...

and murder of a young Nepali girl. A few weeks later, xHamster released a graph that showed that after a slight dip in usage, traffic to its site from Nepal...

Retrieved 30 April 2025. Only the data before 12:33 are reliable on the graph shown here. Sánchez León, J. Guillermo (2 May 2025). "Spain-Portugal blackouts:...

Uva basin is marked by the Haputale mountain ridges, which continue on to Horton Plains and Adam's Peak to the west. CNN in 2010 named Haputale as one of...

considers the bottom-up method of growing the so-called Collatz graph. The Collatz graph is a graph defined by the inverse relation R ( n ) = { { 2 n } if  n...

algorithm, Berlekamp–Zassenhaus algorithm, and the Berlekamp–Van Lint–Seidel graph. Berlekamp had also been active in investing, and ran Axcom, which became...

000 meters. We do not think you have any safety margin." He included a graph of the strain of the design with a skull and crossbones at a red line of...

zaa.go.tz. Retrieved 2016-01-04. "Climate: Stone Town – Climate graph, Temperature graph, Climate table – Climate-Data.org". en.climate-data.org. Retrieved...