Independent sets and matchings in subcubic graphs-Reference-Cited by-同舟云学术

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

Independent sets and matchings in subcubic graphs

Published:2012-06 Issue:11 Volume:312 Page:1900-1910
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Henning Michael A.,Löwenstein Christian,Rautenbach Dieter

Funder

South African National Research Foundation

Deutsche Forschungsgemeinschaft

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference15 articles.

1. A note on Ramsey numbers;Ajtai;J. Combin. Theory Ser. A,1980

2. Tight bounds on maximal and maximum matchings;Biedl;Discrete Math.,2004

3. Linear chromatic bounds for a subfamily of 3K1-free graphs;Choudum;Graphs Combin.,2008

4. Claw-free graphs VI. Colouring;Chudnovsky;J. Combin. Theory Ser. B,2010

5. Maximum matching and a polyhedron with 0, 1-vertices;Edmonds;J. Res. Natl. Bur. Stand. B,1965

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

1. A generalization of Petersen's matching theorem;Discrete Mathematics;2023-03

2. On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree;Frontiers of Algorithmics;2023

3. A characterization of graphs with given maximum degree and smallest possible matching number: II;Discrete Mathematics;2022-03

4. A tight lower bound on the matching number of graphs via Laplacian eigenvalues;European Journal of Combinatorics;2022-03

5. Matching and edge-connectivity in graphs with given maximum degree;Discrete Mathematics;2021-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP