Concepts of signed graph coloring
arXiv:1909.09381 · doi:10.1016/j.ejc.2020.103226
Abstract
This paper surveys recent development of concepts related to coloring of signed graphs. Various approaches are presented and discussed.
arXiv commentfinal version, 28 pages
References in corpus (6)
- The complexity of signed graph and edge-coloured graph homomorphisms
- Homomorphisms of signed planar graphs
- Colouring of generalized signed planar graphs
- Chromatic number of signed graphs with bounded maximum degree
- A short proof of Brooks' theorem
- A note on two conjectures that strengthen the four colour theorem