No CrossRef data available.
Article contents
Weakly 3-Connected Graphs
Published online by Cambridge University Press: 07 June 2006
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
A 3-connected graph $G$ is weakly 3-connected if, for every edge $e$ of $G$, at most one of $G\backslash e$ and $G/e$ is 3-connected. The main result of this paper is that any weakly 3-connected graph can be reduced to $K_4$ by a sequence of simple operations. This extends a result of Dawes [5] on minimally 3-connected graphs.
Information
- Type
- Paper
- Information
- Copyright
- 2006 Cambridge University Press
You have
Access
- 3
- Cited by