Circuit Covers of Signed Graphs

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

Result language
angličtina
Original language name
Circuit Covers of Signed Graphs
Original language description
We introduce the concept of a signed circuit cover of a signed graph. A signed circuit cover is a natural analog of a circuit cover of a graph and is equivalent to a covering of the corresponding signed graphic matroid with circuits. As in the case of graphs, a signed graph has a signed circuit cover only when it admits a nowhere-zero integer flow. In the present article, we establish the existence of a universal coefficient inline image such that every signed graph G that admits a nowhere-zero integer flow has a signed circuit cover of total length at most inline image. We show that if G is bridgeless, then inline image, and in the general case inline image.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

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
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)