Signed Circuit Cover of Bridgeless Signed Graphs

被引：0
作者：
Mengmeng Xie
Chuixiang Zhou
机构：
[1] Ningbo University,School of Mathematics and Statistics
[2] Fuzhou University,Center for Discrete Mathematics
来源：
Graphs and Combinatorics | 2020年 / 36卷
关键词：
Signed graph; Flow-admissible; Signed circuit cover; 05C35; 05C75;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let (G,σ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(G, \sigma )$$\end{document} be a 2-edge-connected flow-admissible signed graph. In this paper, we prove that (G,σ)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(G,\sigma )$$\end{document} has a signed circuit cover with length at most 3|E(G)|.
引用
收藏
页码：1423 / 1443
页数：20
相关论文
共 30 条
[1]  
Alon N(1985)Covering multigraphs by simple circuits SIAM J. Algeb. Discrete Methods 6 345-50
[2]  
Tarsi M(1983)Shortest covering of graphs with cycles J. Combin. Theory Ser. B 35 297-308
[3]  
Bermond JC(1983)Nowhere-zero integral flows on a bidirected graph J. Combin. Theory Ser. B 34 279-292
[4]  
Jackson B(2018)Short signed circuit cover of signed graphs Discrete Appl. Math. 235 51-58
[5]  
Jaeger F(2019)Shortest circuit cover of signed graphs J. Combin. Theory Ser. B 134 164-178
[6]  
Bouchet A(1998)Proofs of two minimum circuit covers conjectures J. Combin. Theory Ser. B 74 353-367
[7]  
Chen J(1992)Short cycle covers and the cycle double cover conjecture J. Combin. Theory Ser. B 56 197-204
[8]  
Fan G(2019)Shorter signed circuit covers of graphs J. Graph Theory 92 39-56
[9]  
Cheng J(2016)Circuit covers of signed graphs J. Graph Theory 81 120-133
[10]  
Lu Y(2019)Circuit covers of signed Eulerian graphs SIAM J. Discrete Math. 33 933-957
123