Perfect matchings in balanced hypergraphs-Reference-Cited by-同舟云学术

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

Perfect matchings in balanced hypergraphs

Published:1996-09 Issue:3 Volume:16 Page:325-329
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Conforti Michele,Cornuéjols Gérard,Kapoor Ajai,Vušković Kristina

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF01261318.pdf

Reference6 articles.

1. Colloq. Math. Soc. János Bolyai;C. Berge,1970

2. C. Berge:Hypergraphs, North Holland (1989).

3. C. Berge, andM. Las Vergnas: Sur un théorème du type König pour les hypergraphes, Annals of the New York Academy of Sciences 175 (1970), 32–40.

4. M. Conforti, andG. Cornuejols: Balanced 0,±1 matrices, bicoloring and total dual integrality,Mathematical Programming,71 (1995), 249–258.

5. D. R. Fulkerson, A. Hoffman, andR. Oppenheim: On balanced matrices,Mathematical Programming Study,1 (1974), 120–132.

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

1. A hyperedge coloring and application in combinatorial testing;AKCE International Journal of Graphs and Combinatorics;2022-05-04

2. Perfect Matching in k-partite k-graphs and 3-uniform HM-bipartite Hypergraphs;Acta Mathematicae Applicatae Sinica, English Series;2020-07

3. Hall’s and Kőnig’s theorem in graphs and hypergraphs;Discrete Mathematics;2018-10

4. d-matching in 3-uniform hypergraphs;Discrete Mathematics;2018-03

5. Finding Perfect Matchings in Bipartite Hypergraphs;Combinatorica;2017-12-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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