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

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

Full text not available from this repository.

Actions

Actions (login required)

View Item View Item