dc.identifier.uri |
http://dx.doi.org/10.15488/3611 |
|
dc.identifier.uri |
https://www.repo.uni-hannover.de/handle/123456789/3643 |
|
dc.contributor.author |
Mader, W.
|
|
dc.date.accessioned |
2018-08-23T12:15:42Z |
|
dc.date.available |
2018-08-23T12:15:42Z |
|
dc.date.issued |
1994 |
|
dc.identifier.citation |
Mader, W.: On Vertex-Edge-Critically n-Connected Graphs. In: Combinatorics, Probability and Computing 3 (1994), Nr. 2, S. 257-271. DOI: https://doi.org/10.1017/S0963548300001152 |
|
dc.description.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. © 1994, Cambridge University Press. All rights reserved. |
eng |
dc.language.iso |
eng |
|
dc.publisher |
Cambridge : Cambridge University Press |
|
dc.relation.ispartofseries |
Combinatorics, Probability and Computing 3 (1994), Nr. 2 |
|
dc.rights |
Es gilt deutsches Urheberrecht. Das Dokument darf zum eigenen Gebrauch kostenfrei genutzt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden. Dieser Beitrag ist aufgrund einer (DFG-geförderten) Allianz- bzw. Nationallizenz frei zugänglich. |
|
dc.subject |
Finite Simple Graph |
eng |
dc.subject |
Vertices |
eng |
dc.subject |
n-connected Graph |
eng |
dc.subject.ddc |
510 | Mathematik
|
ger |
dc.title |
On Vertex-Edge-Critically n-Connected Graphs |
eng |
dc.type |
Article |
|
dc.type |
Text |
|
dc.relation.issn |
09635483 |
|
dc.relation.doi |
https://doi.org/10.1017/S0963548300001152 |
|
dc.bibliographicCitation.issue |
2 |
|
dc.bibliographicCitation.volume |
3 |
|
dc.bibliographicCitation.firstPage |
257 |
|
dc.bibliographicCitation.lastPage |
271 |
|
dc.description.version |
publishedVersion |
|
tib.accessRights |
frei zug�nglich |
|