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]

@article{ElmasryMS13,
  title = {Every DFS Tree of a 3-Connected Graph Contains a Contractible Edge},
  author = {Amr Elmasry and Kurt Mehlhorn and Jens M. Schmidt},
  year = {2013},
  doi = {10.1002/jgt.21635},
  url = {http://dx.doi.org/10.1002/jgt.21635},
  researchr = {https://researchr.org/publication/ElmasryMS13},
  cites = {0},
  citedby = {0},
  journal = {Journal of Graph Theory},
  volume = {72},
  number = {1},
  pages = {112-121},
}