Construction Sequences and Certifying 3-Connectedness - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Construction Sequences and Certifying 3-Connectedness

Jens M. Schmidt
  • Function : Correspondent author
  • PersonId : 867188

Connectez-vous pour contacter l'auteur


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.
Fichier principal
Vignette du fichier
Schmidt.pdf (225.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00455813 , version 1 (11-02-2010)


  • HAL Id : inria-00455813 , version 1


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⟩


50 View
131 Download


Gmail Facebook Twitter LinkedIn More