Article
On Colorings and Orientations of Signed Graphs
Discrete Mathematics Letters
Document Type
Article
Publication Date
6-1-2023
Disciplines
Abstract
A classical theorem independently due to Gallai and Roy states that a graph G has a proper k-coloring if and only if G has an orientation without coherent paths of length k. An analogue of this result for signed graphs is proved in this article.
DOI
10.47443/dml.2023.080
Citation Information
Daniel Slilaty. "On Colorings and Orientations of Signed Graphs" Discrete Mathematics Letters Vol. 12 (2023) p. 98 - 102 Available at: http://works.bepress.com/dan_slilaty/29/
This work is licensed under CC BY 4.0
