No Detail Found!

On colorings and orientations of signed graphs

Author(s)
Daniel Slilaty Department of Mathematics and Statistics, Wright State University, Dayton, Ohio, USA
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. Keywords: signed graph; signed-graph coloring; orientation; bidirection. 2020 Mathematics Subject Classification: 05C15, 05C22, 05C20.
Publication Details
Page(s) 98-102
Published Journal: Discrete Mathematics Letters, Volume: 12, Issue: 0, Year: 2023

Request the full text from PASTIC

Keywords
Orientation, signed graph, signed-graph coloring, bidirection
0

Citations

0

Downloads

148

Views