Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-08T00:01:28.418Z Has data issue: false hasContentIssue false
  • English
  • Français

On Vertex-Edge-Critically n-Connected Graphs

Published online by Cambridge University Press:  12 September 2008

W. Mader
W. Mader
Affiliation:
Institut für Mathematik, Universität Hanover, 30167 Hanover, Weifengarten 1, Germany
Get access Rights & Permissions [Opens in a new window]

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
Combinatorics, Probability and Computing , Volume 3 , Issue 2 , June 1994 , pp. 257 - 271
Copyright
Copyright © Cambridge University Press 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Mader, W. (1972) Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen. Archiv der Mathematik 23, 219–224.CrossRefGoogle Scholar
[2]Mader, W. (1973) 1-Faktoren von Graphen. Math. Ann. 201, 269–282.CrossRefGoogle Scholar
[3]Mader, W. (1979) Zur Struktur minimal n-fach zusammenhängender Graphen. Abh. Math. Sem. Universität Hamburg 49, 49–69.CrossRefGoogle Scholar
[4]Mader, W. (1985) Minimal n-fach zusammenhängende Digraphen. J. Combinatorial Theory (B) 38, 102–117.CrossRefGoogle Scholar
[5]Mader, W. (in preparation) On vertices of outdegree n in n-minimal digraphs.Google Scholar
[6]Maurer, St. B. and Slater, P. J. (1978) On k-minimally n-edge-connected graphs. Discrete Mathematics 24, 185–195.CrossRefGoogle Scholar