Long induced paths in 3-connected planar graphs
It is shown that every 3-connected planar graph with a large number of vertices has a long induced path.
It is shown that every 3-connected planar graph with a large number of vertices has a long induced path.
Page 1