论文标题
3边缘可着色立方签名图的最短电路盖的注释
A note on shortest circuit cover of 3-edge colorable cubic signed graphs
论文作者
论文摘要
{sign-circuit Cover} $ \ MATHCAL {f} $的签名图$（g，σ）$是一个符号电路家族，涵盖了$（g，σ）$的所有边缘。最短的标志封面问题是由Má$ \ check {\ text {c}} $ajová，raspaud，rollová和škoviera（JGT 2016）引发的，近年来受到了许多关注。在本文中，我们表明，每个流动加热3码可着色立方体签名图$（g，σ）$都有一个带有长度长度的标志电路盖，最多最多$ \ frac {20} {9} {9} | e（g）| $。
A {sign-circuit cover} $\mathcal{F}$ of a signed graph $(G, σ)$ is a family of sign-circuits which covers all edges of $(G, σ)$. The shortest sign-circuit cover problem was initiated by Má$\check{\text{c}}$ajová, Raspaud, Rollová, and Škoviera (JGT 2016) and received many attentions in recent years. In this paper, we show that every flow-admissible 3-edge colorable cubic signed graph $(G, σ)$ has a sign-circuit cover with length at most $\frac{20}{9} |E(G)|$.
