Citation: Rel. Aldred et al., THE 3-CONNECTED GRAPHS WITH A MAXIMUM MATCHING CONTAINING PRECISELY ONE CONTRACTILE EDGE, Journal of graph theory, 18(1), 1994, pp. 37-50
Citation: Rel. Aldred et al., THE 3-CONNECTED GRAPHS HAVING A LONGEST CYCLE CONTAINING ONLY 3 CONTRACTILE EDGES, Journal of graph theory, 17(3), 1993, pp. 361-371
Citation: Rl. Hemminger et Xx. Yu, COVERING CONTRACTILE EDGES IN 3-CONNECTED GRAPHS .2. CHARACTERIZING THOSE WITH COVERS OF SIZE 3, Journal of graph theory, 17(2), 1993, pp. 247-252