Removable edges in 3-connected graphs

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

Journal of Combinatorial Theory Series B

Removable edges of a spanning tree in 3-connected 3-regular graphs

FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics

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

Journal of Graph Theory

A Kuratowski-type theorem for planarity of partially embedded graphs

Computational Geometry: Theory and Applications