A Short Proof of the Size of Edge-Extremal Chordal Graphs
[3] have recently determined the maximum number of edges of a chordal graph with a maximum degree less than $d$ and the matching number at most $\nu$ by exhibiting a family of chordal graphs achieving this bound. We provide simple proof of their result.
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Mahmut Akyigit
2022-08-01
|
| Col·lecció: | Journal of Mathematical Sciences and Modelling |
| Matèries: | |
| Accés en línia: | https://dergipark.org.tr/tr/download/article-file/2194799 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|