BibTeX
CSL-JSON
MLA
Harvard
A note on shortest circuit cover of 3-edge colorable cubic signed graphs
release_ua3e5rzpl5dbrlzd4xqimvhmye
by
Ronggui Xu, Jiaao Li, Xinmin Hou
Released
as a article
.
2022
Abstract
A sign-circuit cover ℱ 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áč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 20/9 |E(G)|.
In text/plain
format
Archived Files and Locations
application/pdf 621.9 kB
file_7lzucyoy5rbupgr4dsofajur24
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
2204.05865v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links