All Questions
1 question
2
votes
1
answer
1k
views
Can we solve Hamiltonian Path problem for biconnected planar graphs in linear time?
Assume that we have a bi-connected planar graph $G$ with $\Delta(G)>3$, and we want to find a Hamiltonian Path in $G$. As we know the st-order of a bi-connected planar graph can be computed in ...
- 241