Signed circuit cover of bridgeless signed graphs

DOI10.1007/S00373-020-02224-2MaRDI QIDQ2227982zbMATH OpenOpenAlexFDO

Authors Mengmeng Xie, Chuixiang Zhou

Publication date 16 February 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-020-02224-2

zbMATH Keywords

signed graphsigned circuit coverflow-admissible

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Flows in graphs (05C21) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites work

• scientific article; zbMATH DE number 3728302 (Why is no real title available?)
• scientific article; zbMATH DE number 3600081 (Why is no real title available?)
• Circuit covers of cubic signed graphs
• Circuit covers of signed Eulerian graphs
• Circuit covers of signed graphs
• Circuit double cover of graphs
• Covering Multigraphs by Simple Circuits
• Minimum \(T\)-joins and signed-circuit covering
• Nowhere-zero integral flows on a bidirected graph
• Polyhedral decompositions of cubic graphs
• Proofs of two minimum circuit cover conjectures
• Short cycle covers and the cycle double cover conjecture
• Short signed circuit covers of signed graphs
• Shorter signed circuit covers of graphs
• Shortest circuit covers of signed graphs
• Shortest coverings of graphs with cycles
• Signed graphs

Cited in

(1)

• Shortest circuit covers of signed graphs

This page was built for publication: Signed circuit cover of bridgeless signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227982)