Shorter signed circuit covers of graphs-Reference-Cited by-同舟云学术

Shorter signed circuit covers of graphs

Author:

Kaiser Tomáš¹^ORCID,Lukot’ka Robert²^ORCID,Máčajová Edita³,Rollová Edita⁴^ORCID

Affiliation:

1. Department of MathematicsUniversity of West BohemiaPlzen Czech Republic

2. Department of Computer ScienceFaculty of Mathematics, Physics and Informatics, Comenius UniversityBratislava Slovakia

3. Department of Computer ScienceComenius University, Faculty of Mathematics, Physics and InformaticsBratislava Slovakia

4. Department of MathematicsInstitute of Theoretical Computer Science, University of West BohemiaPlzen Czech Republic

Funder

Czech Ministry of Education, Youth and Sports

Grantová Agentura Ceské Republiky

Agentúra na Podporu Výskumu a Vývoja

Vedecká Grantová Agentúra MŠVVaŠ SR a SAV

Czech Science Foundation

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

Reference21 articles.

5. Shortest circuit covers of signed graphs;Cheng J.;J. Combin. Theory Ser. B,2019

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

3. Circuit k-covers of signed graphs;Discrete Applied Mathematics;2021-05

5. Minimum $T$-Joins and Signed-Circuit Covering;SIAM Journal on Discrete Mathematics;2020-01