Hypohamiltonian graph
id:
hypohamiltonian-graph-166-8763409
title:
Hypohamiltonian graph
text:
In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.
brand slug:
wiki
category slug:
encyclopedia
description:
Type of graph in graph theory
original url:
https://en.wikipedia.org/wiki/Hypohamiltonian_graph
date created:
2008-07-05T14:56:18Z
date modified:
2024-08-29T20:50:15Z
main entity:
{"identifier":"Q3115577","url":"https://www.wikidata.org/entity/Q3115577"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/95/Lindgren_hypohamiltonian_15.svg","width":480,"height":480}
fields total:
13
integrity:
16