Contractible edges in 3-connected graphs

On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability

Discrete Mathematics

Coloring the faces of convex polyhedra so that like colors are far apart

Journal of Combinatorial Theory Series B

Splitting and contractible edges in 4-connected graphs

Journal of Combinatorial Theory Series B

Contractible Elements in Graphs and Matroids

Combinatorics, Probability and Computing

Every toroidal graph without adjacent triangles is (4, 1)*-choosable

Discrete Applied Mathematics

On the number of contractible triples in 3-connected graphs

Journal of Combinatorial Theory Series B

Contractible edges in a k-connected graph

CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory

Non-contractible non-edges in 2-connected graphs

Information Processing Letters

Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge

Journal of Graph Theory

The circumference of a graph with no K3,t-minor, II

Journal of Combinatorial Theory Series B