Processing math: 100%

Proof

(related to Theorem: Characterization of Planar Hamiltonian Graphs)

Proof

In the following proof, we assume that G(V,E) is a simple, planar and connected graph with n:=|V| vertices.

"\Rightarrow"

"\Leftarrow"


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs


References

Bibliography

  1. Piotrowski, Andreas: Own Research, 2014