Circuit Covers of Signed Eulerian Graphs

DOI10.1137/17M1150098zbMath1430.05070MaRDI QIDQ5232136

Edita Rollová, Martin Škoviera, Edita Máčajová

Publication date: 29 August 2019

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

zbMATH Keywords

Eulerian graphsigned graphcircuit cover

Mathematics Subject Classification ID

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

Related Items (3)

Circuit \(k\)-covers of signed graphs ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ Signed circuit cover of bridgeless signed graphs

Cites Work

• Shortest coverings of graphs with cycles
• Nowhere-zero integral flows on a bidirected graph
• Signed graphs
• Erratum to: T. Zaslavsky, signed graphs
• Short cycle covers and the cycle double cover conjecture
• Shortest circuit covers of signed graphs
• On flows in bidirected graphs
• Circuit Covers of Signed Graphs
• Covering Multigraphs by Simple Circuits
• Shorter signed circuit covers of graphs
• Nowhere-zero flows in signed graphs: A survey
• Nowhere-Zero Flows on Signed Eulerian Graphs
• Unnamed Item

This page was built for publication: Circuit Covers of Signed Eulerian Graphs