A generalization of Petersen's matching theorem

DOI10.1016/J.DISC.2022.113263zbMATH Open1506.05065OpenAlexW4309779540WikidataQ123011163 ScholiaQ123011163MaRDI QIDQ2111920FDOQ2111920

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

zbMATH Keywords

matching numbermaximum degree2-connected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Matching theory
• Congruent Graphs and the Connectivity of Graphs
• Total Domination in Graphs
• A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
• Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
• Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
• Title not available (Why is that?)
• Matching and edge-connectivity in regular graphs
• Tight bounds on maximal and maximum matchings
• Tight lower bounds on the size of a maximum matching in a regular graph
• Induced matchings in subcubic graphs without short cycles
• Independent sets and matchings in subcubic graphs
• Matching and edge-connectivity in graphs with given maximum degree
• 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
• Uniquely restricted matchings in subcubic graphs
• Tight lower bounds on the matching number in a graph with given maximum degree
• A characterization of graphs with given maximum degree and smallest possible matching number
• A characterization of graphs with given maximum degree and smallest possible matching number. II

Cited In (4)

• The Monochromatic Circumference of 2‐Edge‐Colored Graphs
• The Petersen matroid
• A generalization of Petersen's theorem
• Efficient algorithms for Petersen's matching theorem

   Recommendations

• A characterization of graphs with given maximum degree and smallest possible matching number 👍 👎
• On maximum matchings in cubic graphs with a bounded number of bridge-covering paths 👍 👎
• Independent sets and matchings in subcubic graphs 👍 👎
• Minimum maximal matchings in cubic graphs 👍 👎
• A characterization of graphs with given maximum degree and smallest possible matching number. II 👍 👎
• Matching and edge-connectivity in regular graphs 👍 👎
• Tight lower bounds on the size of a maximum matching in a regular graph 👍 👎
• Perfect matchings and \(K_{1,p}\)-restricted graphs 👍 👎
• Maximum matchings in a regular graph of specified connectivity and bounded order 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A generalization of Petersen's matching theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111920)