- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: electronic journal of combinatorics(27, 2020), H. 1, S.1-14
- Event
-
Veröffentlichung
- (where)
-
Ilmenau
- (who)
-
TU Ilmenau
- (when)
-
2020
- Creator
- DOI
-
10.37236/8440
- URN
-
urn:nbn:de:101:1-2020070603132037564015
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:52 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lo, On-Hei Solomon
- Schmidt, Jens M.
- Van Cleemput, Nico
- Zamfirescu, Carol T.
- TU Ilmenau
Time of origin
- 2020
Other Objects (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