Abstract
We determine the maximum number of edges that a chordal graph G can have if its degree, Δ (G), and its matching number, ν(G), are bounded. To do so, we show that for every d, ν∈ N, there exists a chordal graph G with Δ (G) < d and ν(G) < ν whose number of edges matches the upper bound, while having a simple structure: it is a disjoint union of cliques and stars.
Cite
CITATION STYLE
Blair, J. R. S., Heggernes, P., Lima, P. T., & Lokshtanov, D. (2020). On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12118 LNCS, pp. 600–612). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-61792-9_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
