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

Strongly Even-Cycle Decomposable Graphs

  • Published:2016-01-18 Issue:2 Volume:84 Page:158-175
  • ISSN:0364-9024
  • Container-title:Journal of Graph Theory
  • language:en
  • Short-container-title:J. Graph Theory

Author:

Huynh Tony1,King Andrew D.2,Oum Sang-il3,Verdian-Rizi Maryam3

Affiliation:

1. DÉPARTEMENT DE MATHÉMATIQUE, UNIVERSITÉ LIBRE DE BRUXELLES; BOULEVARD DU TRIOMPHE; BRUSSELS BELGIUM

2. DEPARTMENT OF MATHEMATICS, SIMON FRASER UNIVERSITY; UNIVERSITY DRIVE; BURNABY BC CANADA

3. DEPARTMENT OF MATHEMATICAL SCIENCES; KAIST; DAEHAK-RO YUSEONG-GU DAEJEON SOUTH KOREA

Funder

National Research Foundation of Korea

European Research Council

EBCO/Ebbich Postdoctoral Scholarship

Natural Sciences and Engineering Research Council of Canada

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference7 articles.

1. Complement reducible graphs;Corneil;Discrete Appl Math,1981

2. (Some of) the many uses of Eulerian graphs in graph theory (plus some applications);Fleischner;Discrete Math,2001

3. T. Huynh S. Oum M. Verdian-Rizi Even cycle decompositions of graphs with no odd- K 4 -minor 2012

4. Even cycle decompositions of 4-regular graphs and line graphs;Markström;Discrete Math,2012

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

1. Strongly even cycle decomposable non-planar line graphs;Discrete Mathematics;2024-05

2. On 4-connected 4-regular graphs without even cycle decompositions;Discrete Mathematics;2022-10

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

4. Algebraic Algorithms for Even Circuits in Graphs;Mathematics;2019-09-17

5. Negative (and positive) circles in signed graphs: A problem collection;AKCE International Journal of Graphs and Combinatorics;2018-04-01
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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