Elmasry, AmrAmrElmasryMehlhorn, KurtKurtMehlhornSchmidt, Jens M.Jens M.Schmidt2020-10-222020-10-222010-12-08Algorithmica (2012)http://hdl.handle.net/11420/7641A graph is triconnected if it is connected, has at least 4 vertices and the removal of any two vertices does not disconnect the graph. We give a certifying algorithm deciding triconnectivity of Hamiltonian graphs with linear running time (this assumes that the cycle is given as part of the input). If the input graph is triconnected, the algorithm constructs an easily checkable proof for this fact. If the input graph is not triconnected, the algorithm returns a separation pair.en1432-054120103-4754766SpringerCertifying algorithmsGraph algorithmsHamiltonian graphTriconnectivityMathematikJournal Article10.1007/s00453-010-9481-2Other