A generalization of Petersen's matching theorem
From MaRDI portal
Publication:2111920
DOI10.1016/j.disc.2022.113263zbMath1506.05065OpenAlexW4309779540WikidataQ123011163 ScholiaQ123011163MaRDI QIDQ2111920
Michael A. Henning, Zekhaya B. Shozi
Publication date: 17 January 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113263
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Induced matchings in subcubic graphs without short cycles
- Independent sets and matchings in subcubic graphs
- Matching and edge-connectivity in regular graphs
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- 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
- A characterization of graphs with given maximum degree and smallest possible matching number. II
- 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
- Congruent Graphs and the Connectivity of Graphs
- 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 generalization of Petersen's matching theorem
