Search Results for ""

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

A quintic symmetric graph is a quintic graph (i.e., regular of degree 5) that is also symmetric. Since quintic graphs exist only on an even number of nodes, so do symmetric ...

The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...

A uniquely Hamiltonian graph is a graph possessing a single Hamiltonian cycle. Classes of uniquely Hamiltonian graphs include the cycle graphs C_n, Hanoi graphs H_n, ladder ...

A number of interesting graphs are associated with the work of van Cleemput and Zamfirescu (2018). Two 13- and 15-node graphs, denoted alpha and beta respectively, were used ...

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

Bezdek and Kuperberg (1991) have constructed packings of identical ellipsoids of densities arbitrarily close to ((24sqrt(2)-6sqrt(3)-2pi)pi)/(72)=0.753355... (OEIS A093824), ...