Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M. Certifying 3-edge-connectivity. (English) Zbl 1356.05150 Algorithmica 77, No. 2, 309-335 (2017). MSC: 05C85 05C40 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Algorithmica 77, No. 2, 309--335 (2017; Zbl 1356.05150) Full Text: DOI arXiv
Mehlhorn, Kurt; Neumann, Adrian; Schmidt, Jens M. Certifying 3-edge-connectivity. (English) Zbl 1417.05226 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 39th international workshop, WG 2013, Lübeck, Germany, June 19–21, 2013. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 8165, 358-369 (2013). MSC: 05C85 05C40 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Lect. Notes Comput. Sci. 8165, 358--369 (2013; Zbl 1417.05226) Full Text: DOI arXiv
Elmasry, Amr; Mehlhorn, Kurt; Schmidt, Jens M. Every DFS tree of a 3-connected graph contains a contractible edge. (English) Zbl 1259.05097 J. Graph Theory 72, No. 1-2, 112-121 (2013). MSC: 05C40 05C05 PDFBibTeX XMLCite \textit{A. Elmasry} et al., J. Graph Theory 72, No. 1--2, 112--121 (2013; Zbl 1259.05097) Full Text: DOI
Elmasry, Amr; Mehlhorn, Kurt; Schmidt, Jens M. An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs. (English) Zbl 1239.05107 Algorithmica 62, No. 3-4, 754-766 (2012). MSC: 05C40 05C45 05C85 PDFBibTeX XMLCite \textit{A. Elmasry} et al., Algorithmica 62, No. 3--4, 754--766 (2012; Zbl 1239.05107) Full Text: DOI