发表评论

Shorter signed circuit covers of graphs. (arXiv:1706.03808v1 [math.CO])

来源于:arXiv
A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero flow. We show that each flow-admissible signed graph on $m$ edges can be covered by signed circuits of

发表评论

用户名:   登录|注册账号
标题:
评论:
使用预览按钮!检查错误!引用添加:[quote][/quote] 链接添加:[url][/url]