1. Covering three edges with a bond in a nonseparable graph;Chakravarti,1979
2. Non-separating cycles in 4-connected graphs;Curran;SIAM J. Discrete Math.,2003
3. The Kelmans-Seymour conjecture I, special separations;He;J. Comb. Theory, Ser. B,2019
4. Non-separating paths in 4-connected graphs;Kawarabayashi;Ann. Comb.,2005
5. Every minimal counterexample to the Dirac conjecture is 5-connected;Kelmans,1979