Construction sequences and certifying 3-connectedness

DOI10.4230/LIPICS.STACS.2010.2491MaRDI QIDQ3113786zbMATH OpenOpenAlexFDO

Authors Jens M. Schmidt

Publication date 23 January 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_8892.html

zbMATH Keywords

3-connected graph3-connectednesscertifying algorithmconstruction sequenceinductive characterizationnested subdivisions

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Construction sequences and certifying 3-connectivity
• Certifying 3-connectivity in linear time
• Contractions, removals, and certifying 3-connectivity in linear time

Cited in

(6)

• Edge-orders
• Construction sequences and certifying 3-connectivity
• An O(n+m) certifying triconnnectivity algorithm for Hamiltonian graphs
• Mondshein sequences (a.k.a. (2,1)-orders)
• Contractions, removals, and certifying 3-connectivity in linear time
• Certifying algorithms

This page was built for publication: Construction sequences and certifying 3-connectedness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113786)