A characterization of nonfeasible sets in matching covered graphs-Reference-Cited by-同舟云学术

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

A characterization of nonfeasible sets in matching covered graphs

Published:2020-04-16 Issue:4 Volume:95 Page:509-526
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J Graph Theory

Author:

Liu Qinghai¹^ORCID,Cui Qing²,Feng Xing³,Lu Fuliang⁴^ORCID

Affiliation:

1. Center for Discrete Mathematics Fuzhou University Fuzhou China

2. Department of Mathematics Nanjing University of Aeronautics and Astronautics Nanjing China

3. Faculty of Science Jiangxi University of Science and Technology Ganzhou China

4. School of Mathematics and Statistics Minnan Normal University Zhangzhou China

Funder

National Natural Science Foundation of China

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.22570

Reference11 articles.

1. Graph Theory

2. Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice

3. Graphs with independent perfect matchings

4. How to build a brick

5. On perfect matchings in matching covered graphs

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP