I have a conjecture about the Hamiltonian path, expressed as follows. Is it correct?
For a connected graph $G$, if every vertex of $G$ is an end-vertex of some longest path of $G$, then $G$ has a Hamilton path.
I have a conjecture about the Hamiltonian path, expressed as follows. Is it correct?
For a connected graph $G$, if every vertex of $G$ is an end-vertex of some longest path of $G$, then $G$ has a Hamilton path.
Copyright © 2021 JogjaFile Inc.