Circuit Covers of Signed Eulerian Graphs
-
Published:2021-01-29
Issue:1
Volume:28
Page:
-
ISSN:1077-8926
-
Container-title:The Electronic Journal of Combinatorics
-
language:
-
Short-container-title:Electron. J. Combin.
Author:
Bao Bo,Chen Rong,Fan Genghua
Abstract
A signed circuit cover of a signed graph is a natural analog of a circuit cover of a graph, and is equivalent to a covering of its corresponding signed-graphic matroid with circuits. It was conjectured that a signed graph whose signed-graphic matroid has no coloops has a 6-cover. In this paper, we prove that the conjecture holds for signed Eulerian graphs.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics