Weak-odd chromatic index of special digraph classes

DOI10.1016/J.DAM.2022.10.006MaRDI QIDQ6391364arXivFDO

Authors Ruijuan Gu, Hui Lei, Xiaopan Lian, Zhenyu Taoqiu

Publication date 16 February 2022

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.DAM.2022.10.006

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

arXiv classification

math.CO

Abstract: Give a digraph $D=(V(D),A(D))$, let $partia{l}_D^{+}(v)=vw|win{N}_D^{+}(v)$ and $partia{l}_D^{-}(v)=uv|uin{N}_D^{-}(v)$ be semi-cuts of $v$. A mapping $varphi:A(D)ightarrow[k]$ is called a weak-odd $k$-edge coloring of $D$ if it satisfies the condition: for each $vinV(D)$, there is at least one color with an odd number of occurrences on each non-empty semi-cut of $v$. We call the minimum integer $k$ the weak-odd chromatic index of $D$. When limit to 2 colors, use $def(D)$ to denote the defect of $D$, the minimum number of vertices in $D$ at which the above condition is not satisfied. In this paper, we give a descriptive characterization about the weak-odd chromatic index and the defect of semicomplete digraphs and extended tournaments, which generalize results of tournaments to broader classes. And we initiated the study of weak-odd edge covering on digraphs.

This page was built for publication: Weak-odd chromatic index of special digraph classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6391364)