Circuit covers of signed Eulerian graphs

DOI10.37236/9084zbMath1456.05095arXiv1910.09999OpenAlexW3129787032MaRDI QIDQ2223467

Rong Chen, Bo Bao, Geng-Hua Fan

Publication date: 29 January 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

signed-graphic matroidsigned circuit cover of a signed graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Signed and weighted graphs (05C22) Flows in graphs (05C21)

Cites Work

• Biased graphs. I: Bias, balance, and gains
• Shortest coverings of graphs with cycles
• Graphical representations of graphic frame matroids
• Integer flows and cycle covers
• Shortest circuit covers of signed graphs
• Nowhere-Zero Flows on Signed Eulerian Graphs

This page was built for publication: Circuit covers of signed Eulerian graphs