Matching and edge-connectivity in graphs with given maximum degree
From MaRDI portal
Publication:2032857
DOI10.1016/j.disc.2021.112438zbMath1466.05110OpenAlexW3158214365MaRDI QIDQ2032857
Michael A. Henning, Anders Yeo
Publication date: 14 June 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112438
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Vertex degrees (05C07)
Related Items (3)
A complete description of convex sets associated with matchings and edge‐connectivity in graphs ⋮ A characterization of graphs with given maximum degree and smallest possible matching number. II ⋮ A generalization of Petersen's matching theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Matchings in regular graphs from eigenvalues
- Matching theory
- Tight bounds on maximal and maximum matchings
- 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
- Maximum matchings in a regular graph of specified connectivity and bounded order
- Total Domination in Graphs
- On Lower Bounds for the Matching Number of Subcubic Graphs
- A complete description of convex sets associated with matchings and edge‐connectivity in 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: Matching and edge-connectivity in graphs with given maximum degree
