Circuit Covers of Signed Eulerian Graphs
Combinatorics
2021-06-21 v2
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.
Cite
@article{arxiv.1910.09999,
title = {Circuit Covers of Signed Eulerian Graphs},
author = {Bo Bao and Rong Chen and Genghua Fan},
journal= {arXiv preprint arXiv:1910.09999},
year = {2021}
}
Comments
12 pages, 1 figure