On Lower Bounds for the Matching Number of Subcubic Graphs
Author:
Affiliation:
1. DEPARTMENT OF COMBINATORICS AND OPTIMIZATION; UNIVERSITY OF WATERLOO; WATERLOO ONTARIO CANADA
2. MATHEMATICAL INSTITUTE; UNIVERSITY OF OXFORD; WOODSTOCK ROAD OXFORD OX2 6GG UNITED KINGDOM
Funder
Natural Sciences and Engineering Research Council of Canada
Publisher
Wiley
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference7 articles.
1. Tight bounds on maximal and maximum matchings;Biedl;Discrete Math,2004
2. Small transversals in hypergraphs;Chvátal;Combinatorica,1992
3. Ewgenij Gawrilow and Michael Joswig, polymake: a framework for analyzing convex polytopes, Polytopes-combinatorics and computation (Oberwolfach, 1997) 2000
4. Independent sets and matchings in subcubic graphs;Henning;Discrete Math,2012
5. Tight lower bounds on the size of a matching in a regular graph;Henning;Graphs Comb,2007
Cited by 10 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 complete description of convex sets associated with matchings and edge‐connectivity in graphs;Journal of Graph Theory;2022-06-21
4. A tight lower bound on the matching number of graphs via Laplacian eigenvalues;European Journal of Combinatorics;2022-03
5. A characterization of graphs with given maximum degree and smallest possible matching number: II;Discrete Mathematics;2022-03
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3