Hypohamiltonian graph
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.
Link from a Wikipage to another Wikipage
primaryTopic
Hypohamiltonian graph
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.
has abstract
En théorie des graphes, un gra ...... uffit à le rendre hamiltonien.
@fr
In the mathematical field of g ...... vertex from G is Hamiltonian.
@en
В теории графов говорят, что г ...... из G, является гамильтоновым.
@ru
Link from a Wikipage to an external page
Wikipage page ID
18,301,304
page length (characters) of wiki page
Wikipage revision ID
1,025,921,162
Link from a Wikipage to another Wikipage
mode
cs2
@en
title
Hypohamiltonian Graph
@en
urlname
HypohamiltonianGraph
@en
wikiPageUsesTemplate
hypernym
type
comment
En théorie des graphes, un gra ...... uffit à le rendre hamiltonien.
@fr
In the mathematical field of g ...... vertex from G is Hamiltonian.
@en
В теории графов говорят, что г ...... из G, является гамильтоновым.
@ru
label
Graphe hypohamiltonien
@fr
Hypohamiltonian graph
@en
Гипогамильтонов граф
@ru