- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: 10.2298/AADM170716024G
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2019
- Creator
-
Guo, Litao
Su, Guifu
Volkmann, Lutz
Zhao, Xingke
- DOI
-
10.18154/RWTH-2019-04254
- URN
-
urn:nbn:de:101:1-2022101001325419720365
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:20 AM CEST
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
- Guo, Litao
- Su, Guifu
- Volkmann, Lutz
- Zhao, Xingke
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2019
Other Objects (12)
Maximally connected graphs and digraphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
HOMOGENEOUSLY TRACEABLE AND HAMILTONIAN CONNECTED GRAPHS
Logarithmic singularities and maximally supersymmetric amplitudes
CONNECTED PARTITIONS AND CYCLE MATROIDS OF GRAPHS
Structure and constructions of 3-connected graphs
Efficient facility layout planning in a maximally planar graph model
Maximally N $$ \mathcalN} $$ -extended super-BMS3 algebras and generalized 3D gravity solutions
Maximally selected chi-square statistics and umbrella orderings
Near-Circularity in Capacity and Maximally Convergent Polynomials
Maximally supersymmetric RG flows in 4D and integrability
Maximally connected graphs and digraphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
HOMOGENEOUSLY TRACEABLE AND HAMILTONIAN CONNECTED GRAPHS
Logarithmic singularities and maximally supersymmetric amplitudes
CONNECTED PARTITIONS AND CYCLE MATROIDS OF GRAPHS
Structure and constructions of 3-connected graphs
Efficient facility layout planning in a maximally planar graph model
Maximally N $$ \mathcalN} $$ -extended super-BMS3 algebras and generalized 3D gravity solutions
Maximally selected chi-square statistics and umbrella orderings
Near-Circularity in Capacity and Maximally Convergent Polynomials
Maximally supersymmetric RG flows in 4D and integrability
Maximally connected graphs and digraphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Sufficient Conditions for Graphs to Be $\textitk}$-Connected, Maximally Connected, and Super-Connected
HOMOGENEOUSLY TRACEABLE AND HAMILTONIAN CONNECTED GRAPHS
Logarithmic singularities and maximally supersymmetric amplitudes
CONNECTED PARTITIONS AND CYCLE MATROIDS OF GRAPHS
Structure and constructions of 3-connected graphs
Efficient facility layout planning in a maximally planar graph model
Maximally N $$ \mathcalN} $$ -extended super-BMS3 algebras and generalized 3D gravity solutions
Maximally selected chi-square statistics and umbrella orderings
Near-Circularity in Capacity and Maximally Convergent Polynomials