- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Mader, W.: On Vertices of Degree n in Minimally n-Edge-Connected Graphs. In: Combinatorics, Probability and Computing 4 (1995), Nr. 1, S. 81-95. DOI: https://doi.org/10.1017/S0963548300001498
- Ereignis
-
Veröffentlichung
- (wo)
-
Hannover, Hannover
- (wer)
-
Gottfried Wilhelm Leibniz Universität Hannover, Technische Informationsbibliothek (TIB)
- (wann)
-
1995
- DOI
-
10.15488/3612
- URN
-
urn:nbn:de:101:1-2020060307044309135118
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:53 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Gottfried Wilhelm Leibniz Universität Hannover, Technische Informationsbibliothek (TIB)
Entstanden
- 1995
Ähnliche Objekte (12)
On Vertex-Edge-Critically n-Connected Graphs
Critical vertices in k-connected digraphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Ready to order? : on vertex and edge orderings of graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Vertex
Combinatorial and graph theoretical aspects of two-edge connected reliability
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
Generalized vertex algebras and relative vertex operators
Algorithms for computing the 2-vertex-connected components and the 2-blocks of directed graphs
On Vertex-Edge-Critically n-Connected Graphs
Critical vertices in k-connected digraphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Ready to order? : on vertex and edge orderings of graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Vertex
Combinatorial and graph theoretical aspects of two-edge connected reliability
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
Generalized vertex algebras and relative vertex operators
Algorithms for computing the 2-vertex-connected components and the 2-blocks of directed graphs
On Vertex-Edge-Critically n-Connected Graphs
Critical vertices in k-connected digraphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Ready to order? : on vertex and edge orderings of graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Vertex
Combinatorial and graph theoretical aspects of two-edge connected reliability
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
Generalized vertex algebras and relative vertex operators