- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Freiberg, TU Bergakademie Freiberg, Dissertation, 2018
- Schlagwort
-
Graphic methods
Zusammenhängender Graph
Kantenfärbung
- Ereignis
-
Veröffentlichung
- (wo)
-
Freiberg
- (wer)
-
Technische Universität Bergakademie Freiberg
- (wann)
-
2018
- Urheber
- Beteiligte Personen und Organisationen
-
Schiermeyer, Ingo
Schiermeyer, Ingo
Kemnitz, Arnfried
- URN
-
urn:nbn:de:bsz:105-qucosa2-312458
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.20232023, 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
- Doan, Trung Duy
- Schiermeyer, Ingo
- Kemnitz, Arnfried
- Technische Universität Bergakademie Freiberg
Entstanden
- 2018
Ähnliche Objekte (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
Note on functions proper to represent a substitution of a prime number of letters.
Holes in graphs of large chromatic number
The clique number of generalized Hamming graphs
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
On Selkow's bound on the independence number of graphs
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
Note on functions proper to represent a substitution of a prime number of letters.
Holes in graphs of large chromatic number
The clique number of generalized Hamming graphs
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
On Selkow's bound on the independence number of graphs
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
Note on functions proper to represent a substitution of a prime number of letters.
Holes in graphs of large chromatic number
The clique number of generalized Hamming graphs
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