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]

Authors

Amr Elmasry

This author has not been identified. Look up 'Amr Elmasry' in Google

Kurt Mehlhorn

This author has not been identified. Look up 'Kurt Mehlhorn' in Google

Jens M. Schmidt

This author has not been identified. Look up 'Jens M. Schmidt' in Google