3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected. - Qiuju Bian; Ronald J. Gould; Paul Horn; Susan Janiszewski; Steve La Fleur; Paul Wrayno (Graphs Comb., 2014)