Circuit covers of signed Eulerian graphs

DOI10.1137/17M1150098MaRDI QIDQ5232136zbMATH OpenFDO

Authors E. Máčajová, Edita Rollová, Martin Škoviera

Publication date 29 August 2019

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

signed graphEulerian graphcircuit cover

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Circuit covers of signed Eulerian graphs
• Circuit \(k\)-covers of signed graphs
• Circuit covers of signed graphs
• Shorter signed circuit covers of graphs
• A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs

Cites work

• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• Circuit covers of signed graphs
• Covering Multigraphs by Simple Circuits
• Erratum to: T. Zaslavsky, signed graphs
• Nowhere-zero flows in signed graphs: a survey
• Nowhere-zero flows on signed Eulerian graphs
• Nowhere-zero integral flows on a bidirected graph
• On flows in bidirected graphs
• Short cycle covers and the cycle double cover conjecture
• Shorter signed circuit covers of graphs
• Shortest circuit covers of signed graphs
• Shortest coverings of graphs with cycles
• Signed graphs

Cited in

(7)

• Shortest circuit covers of signed graphs
• Strongly even cycle decomposable 4-regular line graphs
• Short signed circuit covers of signed graphs
• scientific article; zbMATH DE number 446493 (Why is no real title available?)
• Circuit covers of signed Eulerian graphs
• Signed circuit cover of bridgeless signed graphs
• Circuit \(k\)-covers of signed graphs

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

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