Shortest circuit covers of signed graphs

DOI10.1016/j.jctb.2018.06.001zbMath1402.05095arXiv1510.05717OpenAlexW2963140626MaRDI QIDQ1633748

Cun-Quan Zhang, You Lu, Rong Luo, Jian Cheng

Publication date: 20 December 2018

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.05717

zbMATH Keywords

signed graphshortest circuit covergeneralized barbellnegativenesssigned circuit cover

Mathematics Subject Classification ID

Distance in graphs (05C12) Signed and weighted graphs (05C22)

Related Items

Circuit \(k\)-covers of signed graphs ⋮ A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs ⋮ Minimum $T$-Joins and Signed-Circuit Covering ⋮ Circuit covers of signed Eulerian graphs ⋮ Signed circuit cover of bridgeless signed graphs ⋮ Circuit Covers of Signed Eulerian Graphs ⋮ Flow polynomials of a signed graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Circular flow on signed graphs
• Shortest coverings of graphs with cycles
• Nowhere-zero integral flows on a bidirected graph
• Short circuit covers for regular matroids with a nowhere zero 5-flow
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• Short cycle covers and the cycle double cover conjecture
• Shortest circuit covers of cubic graphs
• Fulkerson's conjecture and circuit covers
• Proofs of two minimum circuit cover conjectures
• Short cycle covers of graphs and nowhere-zero flows
• Minimum cycle coverings and integer flows
• Circuit Covers of Signed Graphs
• Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
• Covering Multigraphs by Simple Circuits
• Short cycle covers of cubic graphs
• Graphs with the Circuit Cover Property
• The 7/5‐conjecture strengthens itself