On the maximum number of edges in chordal graphs of bounded degree and matching number

DOI10.1007/978-3-030-61792-9_47MaRDI QIDQ5918513zbMATH OpenOpenAlexFDO

Authors Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov

Publication date 13 October 2022

Published in LATIN 2020: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-61792-9_47

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• On the maximum number of edges in chordal graphs of bounded degree and matching number
• Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
• Graphs with restricted valency and matching number
• Turán graphs with bounded matching number
• Generalization of Erdős-Gallai edge bound

Cited in

(1)

• On the maximum number of edges in chordal graphs of bounded degree and matching number

This page was built for publication: On the maximum number of edges in chordal graphs of bounded degree and matching number

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