Maximal matchings in graphs with given minimal and maximal degrees

DOI10.1017/S0305004100052233zbMath0353.05046OpenAlexW2006717420MaRDI QIDQ4123360

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)

Related Items (max. 100)

Embedding of sign-regular signed graphs and its spectral analysis ⋮ The symmetric (2k, k)-graphs ⋮ 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

Cites Work

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

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