No CrossRef data available.
Article contents
On Vertex-Edge-Critically n-Connected Graphs
Published online by Cambridge University Press: 12 September 2008
Abstract
All digraphs are determined that have the property that when any vertex and any edge that are not adjacent are deleted, the connectivity number decreases by two.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1994