Sufficient conditions for maximally edge-connected and super-edge-connected graphs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: 10.22049/cco.2017.13594
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2017
- Urheber
-
Volkmann, Lutz
Hong, Zhen-Mu
- DOI
-
10.18154/RWTH-2018-222565
- URN
-
urn:nbn:de:101:1-2021032317595907188395
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:37 MESZ
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
- Volkmann, Lutz
- Hong, Zhen-Mu
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2017
Ähnliche Objekte (12)
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Maximally connected graphs and digraphs
On Vertex-Edge-Critically n-Connected Graphs
Maximally and super connected multisplit graphs and digraphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Combinatorial and graph theoretical aspects of two-edge connected reliability
Affine optimal k-proper connected edge colorings
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Connected domination in graphs and v-numbers of binomial edge ideals
Effective elliptic arc selection from connected edge points
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Maximally connected graphs and digraphs
On Vertex-Edge-Critically n-Connected Graphs
Maximally and super connected multisplit graphs and digraphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Combinatorial and graph theoretical aspects of two-edge connected reliability
Affine optimal k-proper connected edge colorings
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Connected domination in graphs and v-numbers of binomial edge ideals
Effective elliptic arc selection from connected edge points
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Maximally connected graphs and digraphs
On Vertex-Edge-Critically n-Connected Graphs
Maximally and super connected multisplit graphs and digraphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Combinatorial and graph theoretical aspects of two-edge connected reliability
Affine optimal k-proper connected edge colorings
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Connected domination in graphs and v-numbers of binomial edge ideals