- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: electronic journal of combinatorics(27, 2020), H. 1, S.1-14
- Ereignis
-
Veröffentlichung
- (wo)
-
Ilmenau
- (wer)
-
TU Ilmenau
- (wann)
-
2020
- Urheber
- DOI
-
10.37236/8440
- URN
-
urn:nbn:de:101:1-2020070603132037564015
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:52 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
- Lo, On-Hei Solomon
- Schmidt, Jens M.
- Van Cleemput, Nico
- Zamfirescu, Carol T.
- TU Ilmenau
Entstanden
- 2020
Ähnliche Objekte (12)
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
On Vertex-Edge-Critically n-Connected Graphs
Combinatorial and graph theoretical aspects of two-edge connected reliability
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Symmetric Cubic Graphs as Cayley Graphs
Pressure coefficient Ko' of bulk modulus for cubic elements
Maximally connected graphs and digraphs
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Short disjoint cycles in cubic bridgeless graphs
Critical edges in perfect graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
On Vertex-Edge-Critically n-Connected Graphs
Combinatorial and graph theoretical aspects of two-edge connected reliability
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Symmetric Cubic Graphs as Cayley Graphs
Pressure coefficient Ko' of bulk modulus for cubic elements
Maximally connected graphs and digraphs
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Short disjoint cycles in cubic bridgeless graphs
Critical edges in perfect graphs
Shortness coefficient of cyclically 4-edge-connected cubic graphs
Longest cycles in cyclically 4-edge-connected cubic planar graphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
On Vertex-Edge-Critically n-Connected Graphs
Combinatorial and graph theoretical aspects of two-edge connected reliability
On Vertices of Degree n in Minimally n-Edge-Connected Graphs
Symmetric Cubic Graphs as Cayley Graphs
Pressure coefficient Ko' of bulk modulus for cubic elements
Maximally connected graphs and digraphs
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
Short disjoint cycles in cubic bridgeless graphs