- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: 10.2298/AADM170716024G
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2019
- Urheber
-
Guo, Litao
Su, Guifu
Volkmann, Lutz
Zhao, Xingke
- DOI
-
10.18154/RWTH-2019-04254
- URN
-
urn:nbn:de:101:1-2022101001325419720365
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:20 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
- Guo, Litao
- Su, Guifu
- Volkmann, Lutz
- Zhao, Xingke
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2019
Ähnliche Objekte (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
Structure and constructions of 3-connected graphs
CONNECTED PARTITIONS AND CYCLE MATROIDS OF 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 self-interacting dark matter: models and predictions
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
Structure and constructions of 3-connected graphs
CONNECTED PARTITIONS AND CYCLE MATROIDS OF 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 self-interacting dark matter: models and predictions
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
Structure and constructions of 3-connected graphs
CONNECTED PARTITIONS AND CYCLE MATROIDS OF 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