Some Remarks on Odd Edge Colorings of Digraphs
The principal aim of this article is to initiate a study of the following coloring notion for digraphs. An odd <i>k</i>-edge coloring of a general digraph (directed pseudograph) <i>D</i> is a (not necessarily proper) coloring of its edges with at most <i>k</i> col...
Main Authors: | Mirko Petruševski, Riste Škrekovski |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-01-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/3/231 |
Similar Items
-
A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs
by: Byoung-Song Chwe
Published: (1994-01-01) -
Odd sum labeling of graphs obtained by duplicating any edge of some graphs
by: S. Arockiaraj, et al.
Published: (2015-10-01) -
Odd Fibonacci edge irregular labeling for some trees obtained from subdivision and vertex identification operations
by: M. Uma Devi, et al.
Published: (2023-03-01) -
Odd facial colorings of acyclic plane graphs
by: Július Czap, et al.
Published: (2021-10-01) -
Coverability of Graphs by Parity Regular Subgraphs
by: Mirko Petruševski, et al.
Published: (2021-01-01)