Minimal graph in which the intersection of two longest paths is not a separator

Abstract

We prove that for a connected simple graph $G$ with $n\le 10$ vertices, and two longest paths $C$ and $D$ in $G$, the intersection of vertex sets $V(C)\cap V(D)$ is a separator. This shows that the graph found previously with $n=11$, in which the complement of the intersection of vertex sets $V(C)\cap V(D)$ of two longest paths is connected, is minimal.

References in corpus (1)

• Bi-traceable graphs, the intersection of three longest paths and Hippchen's conjecture