Circuit covers of signed Eulerian graphs
The electronic journal of combinatorics, Tome 28 (2021) no. 1
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.
DOI :
10.37236/9084
Classification :
05C45, 05C21, 05C22
Mots-clés : signed circuit cover of a signed graph, signed-graphic matroid
Mots-clés : signed circuit cover of a signed graph, signed-graphic matroid
@article{10_37236_9084,
author = {Bo Bao and Rong Chen and Genghua Fan},
title = {Circuit covers of signed {Eulerian} graphs},
journal = {The electronic journal of combinatorics},
year = {2021},
volume = {28},
number = {1},
doi = {10.37236/9084},
zbl = {1456.05095},
url = {http://geodesic.mathdoc.fr/articles/10.37236/9084/}
}
Bo Bao; Rong Chen; Genghua Fan. Circuit covers of signed Eulerian graphs. The electronic journal of combinatorics, Tome 28 (2021) no. 1. doi: 10.37236/9084
Cité par Sources :