Maximal matchings in graphs with given minimal and maximal degrees

DOI10.1017/S0305004100052233zbMATH Open0353.05046OpenAlexW2006717420MaRDI QIDQ4123360FDOQ4123360

Authors: Béla Bollobás, Stephen E. Eldridge 

Publication date: 1976

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004100052233

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• The Factorization of Linear Graphs
• On the Number of Disjoint Edges in a Graph

Cited In (7)

• Maximum degree and fractional matchings in uniform hypergraphs
• On the maximum number of independent edges in cubic graphs
• Matching theory -- a sampler: From Dénes König to the present
• Matchings and covers in hypergraphs
• Minimizing the Laplacian spectral radius of trees with given matching number
• The symmetric (2k, k)-graphs
• Embedding of sign-regular signed graphs and its spectral analysis

This page was built for publication: Maximal matchings in graphs with given minimal and maximal degrees

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