Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
From MaRDI portal
Publication:512562
DOI10.1016/j.disc.2017.01.010zbMath1357.05063OpenAlexW2587214001MaRDI QIDQ512562
Pinar Heggernes, Cemil Dibek, Tınaz Ekim
Publication date: 27 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.01.010
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (2)
On the maximum number of edges in planar graphs of bounded degree and matching number ⋮ On the maximum number of edges in chordal graphs of bounded degree and matching number
Cites Work
This page was built for publication: Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded