Indexed by:
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.
Keyword:
Reprint 's Address:
Email:
Source :
ELECTRONIC JOURNAL OF COMBINATORICS
ISSN: 1077-8926
Year: 2021
Issue: 1
Volume: 28
0 . 6 9
JCR@2021
0 . 7 0 0
JCR@2023
ESI Discipline: MATHEMATICS;
ESI HC Threshold:36
JCR Journal Grade:3
CAS Journal Grade:4
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 1
Affiliated Colleges: