登录 注册 会员服务 联系我们

Circuit Covers of Signed Graphs

  • Published:2015-03-11 Issue:2 Volume:81 Page:120-133
  • ISSN:0364-9024
  • Container-title:Journal of Graph Theory
  • language:en
  • Short-container-title:J. Graph Theory

Author:

Máčajová Edita1,Raspaud André2,Rollová Edita3,Škoviera Martin1

Affiliation:

1. DEPARTMENT OF COMPUTER SCIENCE; COMENIUS UNIVERSITY; MLYNSKÁ DOLINA 842 48 BRATISLAVA SLOVAKIA

2. LABRI; UNIVERSITE DE BORDEAUX; 33405 TALENCE CEDEX FRANCE

3. NTIS - NEW TECHNOLOGIES FOR THE INFORMATION SOCIETY; UNIVERSITY OF WEST BOHEMIA, UNIVERZITNí 22; 306 14 PLZEŇ CZECH REPUBLIC

Funder

APVV (Slovak Republic)

Czech Science Foundation

European Science Foundation

European Social Fund

VEGA (Ministery of Education, Slovak Republic)

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference26 articles.

1. Covering multigraphs by simple circuits;Alon;SIAM J Algebraic Discrete Methods,1985

2. Graphs with the circuit cover property;Alspach;Trans Amer Math Soc,1994

3. Shortest covering of graphs with cycles;Bermond;J Combin Theory Ser B,1983

4. Nowhere-zero integral flows on a bidirected graph;Bouchet;J Combin Theory Ser B,1983

5. Flows on bidirected graphs;DeVos;arXiv

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

1. A Note on Shortest Sign-Circuit Cover of Signed 3-Edge-Colorable Cubic Graphs;Graphs and Combinatorics;2022-08-17

2. Strongly even cycle decomposable 4-regular line graphs;European Journal of Combinatorics;2021-05

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

4. Signed Circuit Cover of Bridgeless Signed Graphs;Graphs and Combinatorics;2020-08-27

5. Minimum $T$-Joins and Signed-Circuit Covering;SIAM Journal on Discrete Mathematics;2020-01
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3