On Colorings and Orientations of Signed Graphs

Authors

Daniel Slilaty, Wright State University - Main CampusFollow

Document Type

Article

Publication Date

6-1-2023

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.

Comments

This work is licensed under CC BY 4.0

Repository Citation

Slilaty, D. (2023). On Colorings and Orientations of Signed Graphs. Discrete Mathematics Letters, 12, 98-102.
https://corescholar.libraries.wright.edu/math/472

DOI

10.47443/dml.2023.080