Barnette–Bosák–Lederberg graph
id:
barnette-bos-k-lederberg-graph-241-4265211
title:
Barnette–Bosák–Lederberg graph
text:
In the mathematical field of graph theory, the Barnette–Bosák–Lederberg graph is a cubic polyhedral graph with no Hamiltonian cycle, the smallest such graph possible. It was discovered in the mid-1960s by Joshua Lederberg, David Barnette, and Juraj Bosák, after whom it is named. It has 38 vertices and 57 edges. Other larger non-Hamiltonian cubic polyhedral graphs include the 46-vertex Tutte graph and a 44-vertex graph found by Emanuels Grīnbergs using Grinberg's theorem.
The Barnette–Bosák–Leder
brand slug:
wiki
category slug:
encyclopedia
description:
Non-Hamiltonian simple polyhedron
original url:
https://en.wikipedia.org/wiki/Barnette%E2%80%93Bos%C3%A1k%E2%80%93Lederberg_graph
date created:
date modified:
2024-01-09T22:39:34Z
main entity:
{"identifier":"Q3115470","url":"https://www.wikidata.org/entity/Q3115470"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/41/Barnette-Bosak-Lederberg_graph_%28Lombardi_drawing%29.svg","width":1014,"height":958}
fields total:
13
integrity:
15