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

Amr Elmasry, Kurt Mehlhorn, Jens M. Schmidt. Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge. Journal of Graph Theory, 72(1):112-121, 2013. [doi]

Abstract

Abstract is missing.