Coloring of signed graphs / by Yingli Kang ; Adviser: Prof. Dr. Eckhard Steffen. Paderborn, 2018
Inhalt
- Acknowledgements
- Contents
- List of Figures
- 1 Introduction
- 2 Circular chromatic number c of signed graphs
- 2.1 (k,d)-colorings of a signed graph
- 2.1.1 A recoloring technique: Updating
- 2.1.2 Basic properties of (k,d)-colorings
- 2.1.3 c((G,)): from infimum to minimum
- 2.2 Circular r-colorings of a signed graph
- 2.3 Relation between c((G,)) and ((G,))
- 2.4 Signed graphs for which c=
- 3 Chromatic number of signed graphs
- 3.1 Some basic properties
- 3.2 Chromatic spectrum of a graph
- 3.3 An analogue of Brooks' Theorem for signed graphs
- 3.4 First Hajós-like theorem for signed graphs
- 4 Signed chromatic number of signed graphs
- 4.1 Preliminary
- 4.2 Signed chromatic spectrum of a graph
- 4.3 Second Hajós-like theorem for signed graphs
- 4.4 Relation between and
- 5 Choosability in signed graphs
- 6 3-colorings of planar graphs
- 7 Conclusion and future work
- Bibliography