Number of items: 2.
Article
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.
Elmasry, Amr and Mehlhorn, Kurt and Schmidt, Jens M.
(2012)
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs.
Algorithmica, 62 (3-4).
pp. 754-766.
This list was generated on Sun Dec 22 03:07:41 2024 CET.