Shorter signed circuit covers of graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F19%3A43955745" target="_blank" >RIV/49777513:23520/19:43955745 - isvavai.cz</a>
Result on the web
<a href="https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.22439" target="_blank" >https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.22439</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.22439" target="_blank" >10.1002/jgt.22439</a>

Result language
angličtina
Original language name
Shorter signed circuit covers of graphs
Original language description
A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero flow. We show that each flow-admissible signed graph on m edges can be covered by signed circuits of total length at most (3+2/3)m, improving a recent result of Cheng et al. [manuscript, 2015]. To obtain this improvement we prove several results on signed circuit covers of trees of Eulerian graphs, which are connected signed graphs such that removing all bridges results in a collection of Eulerian graphs.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)