On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number

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

LATIN（2022）

引用 4|浏览22

暂无评分

摘要

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,ν∈ℕ , there exists a chordal graph G with (G)更多

查看译文

关键词

Chordal graphs,Maximum number of edges,Matching number

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要