تقرير
A note on shortest circuit cover of 3-edge colorable cubic signed graphs
| العنوان: | A note on shortest circuit cover of 3-edge colorable cubic signed graphs |
|---|---|
| المؤلفون: | Xu, Ronggui, Li, Jiaao, Hou, Xinmin |
| سنة النشر: | 2022 |
| المجموعة: | Mathematics |
| مصطلحات موضوعية: | Mathematics - Combinatorics, 05C05 |
| الوصف: | A {sign-circuit cover} $\mathcal{F}$ of a signed graph $(G, \sigma)$ is a family of sign-circuits which covers all edges of $(G, \sigma)$. The shortest sign-circuit cover problem was initiated by M\'a$\check{\text{c}}$ajov\'a, Raspaud, Rollov\'a, and \v{S}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, \sigma)$ has a sign-circuit cover with length at most $\frac{20}{9} |E(G)|$. Comment: 12 pages, 4 figures |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2204.05865 |
| رقم الأكسشن: | edsarx.2204.05865 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |