Symmetric set coloring of signed graphs

C. Cappello, E. Steffen, ArXiv:2106.05928 (2021).

Download
No fulltext has been uploaded.
Preprint | English
Abstract
There are many approaches to signed graphs coloring. One of the main difference regards the number of self-inverse elements used. We develop a new coloring by using symmetric sets with different numbers of self-inverse elements. This approach provides a framework to describe all other ways of coloring signed graphs which are defined by assigning colors to the vertices of the graphs. We investigate the specific role of self-inverse colors in signed graph coloring and prove a Brooks' type theorem for these colorings. We also show that this coloring can be formalized as a specific DP-coloring.
Publishing Year
Journal Title
arXiv:2106.05928
LibreCat-ID

Cite this

Cappello C, Steffen E. Symmetric set coloring of signed graphs. arXiv:210605928. Published online 2021.
Cappello, C., & Steffen, E. (2021). Symmetric set coloring of signed graphs. In arXiv:2106.05928.
@article{Cappello_Steffen_2021, title={Symmetric set coloring of signed graphs}, journal={arXiv:2106.05928}, author={Cappello, Chiara and Steffen, Eckhard}, year={2021} }
Cappello, Chiara, and Eckhard Steffen. “Symmetric Set Coloring of Signed Graphs.” ArXiv:2106.05928, 2021.
C. Cappello and E. Steffen, “Symmetric set coloring of signed graphs,” arXiv:2106.05928. 2021.
Cappello, Chiara, and Eckhard Steffen. “Symmetric Set Coloring of Signed Graphs.” ArXiv:2106.05928, 2021.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar