Oriented Chromatic Number of Cartesian Products Pm □ Pn and Cm □ Pn
We consider oriented chromatic number of Cartesian products of two paths Pm □ Pn and of Cartesian products of paths and cycles, Cm □ Pn. We say that the oriented graph G→\vec G is colored by an oriented graph H→\vec H if there is a homomorphism from G→\vec G to H→\vec H. In this paper we show that t...
Main Author: | Nenca Anna |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2022-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2307 |
Similar Items
-
Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
by: Dybizbański Janusz, et al.
Published: (2019-02-01) -
T-Colorings, Divisibility and the Circular Chromatic Number
by: Janczewski Robert, et al.
Published: (2021-05-01) -
Chromatic Properties of the Pancake Graphs
by: Konstantinova Elena
Published: (2017-08-01) -
On the distinguishing chromatic number of the Kronecker products of graphs
by: Zinat Rastgar, et al.
Published: (2024-01-01) -
On the edge chromatic vertex stability number of graphs
by: Saeid Alikhani, et al.
Published: (2023-01-01)