A characterization of graphs with given maximum degree and smallest possible matching number. II

DOI10.1016/J.DISC.2021.112731zbMath1480.05028OpenAlexW4200610777MaRDI QIDQ2065903

Zekhaya B. Shozi, Michael A. Henning

Publication date: 13 January 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112731

zbMATH Keywords

matching numbermaximum degreefactor-critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (1)

A generalization of Petersen's matching theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Induced matchings in subcubic graphs without short cycles
• Independent sets and matchings in subcubic graphs
• Matching and edge-connectivity in regular graphs
• Matching theory
• Tight bounds on maximal and maximum matchings
• A characterization of graphs with given maximum degree and smallest possible matching number
• Matching and edge-connectivity in graphs with given maximum degree
• Uniquely restricted matchings in subcubic graphs
• Tight lower bounds on the size of a maximum matching in a regular graph
• Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Tight lower bounds on the matching number in a graph with given maximum degree
• Total Domination in Graphs
• On Lower Bounds for the Matching Number of Subcubic Graphs
• A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number

This page was built for publication: A characterization of graphs with given maximum degree and smallest possible matching number. II