Signed circuit cover of bridgeless signed graphs

DOI10.1007/s00373-020-02224-2zbMath1458.05101OpenAlexW3080247920MaRDI QIDQ2227982

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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Signed and weighted graphs (05C22) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest coverings of graphs with cycles
• Nowhere-zero integral flows on a bidirected graph
• Signed graphs
• Short cycle covers and the cycle double cover conjecture
• Proofs of two minimum circuit cover conjectures
• Shortest circuit covers of signed graphs
• Short signed circuit covers of signed graphs
• Circuit Double Cover of Graphs
• Circuit Covers of Signed Graphs
• Covering Multigraphs by Simple Circuits
• Circuit covers of cubic signed graphs
• Minimum $T$-Joins and Signed-Circuit Covering
• Circuit Covers of Signed Eulerian Graphs
• Shorter signed circuit covers of graphs
• Polyhedral decompositions of cubic graphs

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