In graph theory, a branch of mathematics, Fleischner's theorem gives a sufficient condition for a graph to contain a Hamiltonian cycle. It states that, if G {\displaystyle G} is a 2-vertex-connected graph, then the square of G {\displaystyle G} is Hamiltonian.
In graph theory, a branch of mathematics, Fleischner's theorem gives a sufficient condition for a graph to contain a Hamiltonian cycle. It states that, if G {\displaystyle G} is a 2-vertex-connected graph, then the square of G {\displaystyle G} is Hamiltonian.
Source: Wikipedia "Fleischner's theorem" · CC BY-SA 4.0
Share this article: X · Bluesky