| Information | |
|---|---|
| has gloss | eng: In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian. |
| lexicalization | eng: hypohamiltonian graph |
| instance of | c/Graph families |
| Meaning | |
|---|---|
| French | |
| has gloss | fra: En théorie des graphes, un graphe est hypohamiltonien sil na pas de cycle hamiltonien mais que la suppression de n'importe quel sommet du graphe suffit à le rendre hamiltonien. |
| lexicalization | fra: graphe hypohamiltonien |
| Media | |
|---|---|
| media:img | Lindgren hypohamiltonian 15.svg |
| media:img | Thomassen girth-3 hypohamiltonian.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint