# Search results for: Xueliang Li

Discrete Mathematics > 2004 > 287 > 1-3 > 103-111

Journal of Combinatorial Theory, Series B > 2004 > 92 > 1 > 13-40

Graphs and Combinatorics > 2004 > 20 > 3 > 413-422

*G*be a 4-connected graph. For an edge

*e*of

*G*, we do the following operations on

*G*: first, delete the edge

*e*from

*G*, resulting the graph

*G*−

*e*; second, for all vertices

*x*of degree 3 in

*G*−

*e*, delete

*x*from

*G*−

*e*and then completely connect the 3 neighbors of

*x*by a triangle. If multiple edges occur, we use single edges to replace them. The final resultant graph is denoted by

*G*⊖

*e*. If

*G*⊖

*e*is 4-connected,...