Construction Sequences and Certifying 3-Connectedness

Jens M. Schmidt 1, *
* Corresponding author
Abstract : Tutte proved that every 3-connected graph on more than 4 nodes has a contractible edge. Barnette and Gruenbaum proved the existence of a removable edge in the same setting. We show that the sequence of contractions and the sequence of removals from G to the K_4 can be computed in O(|V|^2) time by extending Barnette and Gruenbaum's theorem. As an application, we derive a certificate for the 3-connectedness of graphs that can be easily computed and verified.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/inria-00455813
Contributor : Publications Loria <>
Submitted on : Thursday, February 11, 2010 - 11:56:17 AM
Last modification on : Wednesday, February 27, 2019 - 11:08:02 AM
Long-term archiving on : Friday, June 18, 2010 - 8:14:04 PM

File

Schmidt.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00455813, version 1

Collections

Citation

Jens M. Schmidt. Construction Sequences and Certifying 3-Connectedness. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.633-644. ⟨inria-00455813⟩

Share

Metrics

Record views

151

Files downloads

138