- AutorIn
- Sara Kischnick
- Titel
- Rainbow Colorings in Graphs
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:105-qucosa2-335847
- Datum der Einreichung
- 05.11.2018
- Datum der Verteidigung
- 12.02.2019
- Abstract (EN)
- In this thesis, we deal with rainbow colorings of graphs. We engage not with the rainbow connection number but with counting of rainbow colorings in graphs with k colors. We introduce the rainbow polynomial and prove some results for some special graph classes. Furthermore, we obtain bounds for the rainbow polynomial. In addition, we define some edge colorings related to the rainbow coloring, like the s-rainbow coloring and the 2-rainbow coloring. For this edge colorings, polynomials are defined and we prove some basic properties for this polynomials and present some formulas for the calculation in special graph classes. In addition, we consider in this thesis counting problems related to the rainbow coloring like rainbow pairs and rainbow dependent sets. We introduce polynomials for this counting problems and present some general properties and formulas for special graph classes.
- Freie Schlagwörter (DE)
- Regenbogenfärbungen, Zählen von Regenbogenfärbungen
- Freie Schlagwörter (EN)
- rainbow coloring, counting rainbow colorings
- Klassifikation (DDC)
- 510
- Normschlagwörter (GND)
- Kantenfärbung
- GutachterIn
- Prof. Dr. rer. nat. Peter Tittmann
- Prof. Dr. rer. nat. habil. Ingo Schiermeyer
- BetreuerIn Hochschule / Universität
- Prof. Dr. rer. nat. Peter Tittmann
- Prof. Dr. rer. nat. habil. Ingo Schiermeyer
- Den akademischen Grad verleihende / prüfende Institution
- TU Bergakademie Freiberg, Freiberg
- Hochschule Mittweida, Mittweida
- URN Qucosa
- urn:nbn:de:bsz:105-qucosa2-335847
- Veröffentlichungsdatum Qucosa
- 05.04.2019
- Dokumenttyp
- Dissertation
- Sprache des Dokumentes
- Englisch