Matching and edge-connectivity in regular graphs

DOI10.1016/j.ejc.2010.10.005zbMath1218.05144OpenAlexW2117400811MaRDI QIDQ616391

Suil O, Douglas B. West

Publication date: 7 January 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2010.10.005

zbMATH Keywords

maximum matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (19)

Average connectivity and average edge-connectivity in graphs ⋮ Matchings in graphs of odd regularity and girth ⋮ 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 ⋮ On the path partition number of 6‐regular graphs ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Matchings in graphs from the spectral radius ⋮ Eigenvalues and parity factors in graphs with given minimum degree ⋮ Hamiltonicity in connected regular graphs ⋮ Spectral radius and matchings in graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius ⋮ Unnamed Item ⋮ A characterization of graphs with given maximum degree and smallest possible matching number ⋮ Matching and edge-connectivity in graphs with given maximum degree ⋮ Unnamed Item ⋮ A characterization of graphs with given maximum degree and smallest possible matching number. II ⋮ A tight lower bound on the matching number of graphs via Laplacian eigenvalues ⋮ A generalization of Petersen's matching theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular factors of simple regular graphs and factor-spectra
• 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
• A sufficient condition for graphs with 1-factors
• Maximum matchings in a regular graph of specified connectivity and bounded order
• The Factorization of Linear Graphs

This page was built for publication: Matching and edge-connectivity in regular graphs