- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Freiberg, TU Bergakademie Freiberg, Dissertation, 2018
- Keyword
-
Graphic methods
Zusammenhängender Graph
Kantenfärbung
- Event
-
Veröffentlichung
- (where)
-
Freiberg
- (who)
-
Technische Universität Bergakademie Freiberg
- (when)
-
2018
- Creator
- Contributor
-
Schiermeyer, Ingo
Schiermeyer, Ingo
Kemnitz, Arnfried
- URN
-
urn:nbn:de:bsz:105-qucosa2-312458
- 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
- Doan, Trung Duy
- Schiermeyer, Ingo
- Kemnitz, Arnfried
- Technische Universität Bergakademie Freiberg
Time of origin
- 2018
Other Objects (12)
Number of proper quaterneary ics.
Number of proper Tenary n-ICS.
Recognizing Proper Tree-Graphs
Optimization of connection structures in graphs
The Lovász Number of Random Graphs
The clique number of generalized Hamming graphs
Holes in graphs of large chromatic number
Note on functions proper to represent a substitution of a prime number of letters.
On the signed 2-independence number of graphs
The number of different distinguishing colorings of a graph
Distinguishing number of vertex-transitive graphs of valency 4
Einsatz des Varianten-Connection-Graphs für realzeitfähige Anlagenüberwachungssysteme
Number of proper quaterneary ics.
Number of proper Tenary n-ICS.
Recognizing Proper Tree-Graphs
Optimization of connection structures in graphs
The Lovász Number of Random Graphs
The clique number of generalized Hamming graphs
Holes in graphs of large chromatic number
Note on functions proper to represent a substitution of a prime number of letters.
On the signed 2-independence number of graphs
The number of different distinguishing colorings of a graph
Distinguishing number of vertex-transitive graphs of valency 4
Einsatz des Varianten-Connection-Graphs für realzeitfähige Anlagenüberwachungssysteme
Number of proper quaterneary ics.
Number of proper Tenary n-ICS.
Recognizing Proper Tree-Graphs
Optimization of connection structures in graphs
The Lovász Number of Random Graphs
The clique number of generalized Hamming graphs
Holes in graphs of large chromatic number
Note on functions proper to represent a substitution of a prime number of letters.
On the signed 2-independence number of graphs
The number of different distinguishing colorings of a graph
Distinguishing number of vertex-transitive graphs of valency 4