Degree-doubling graph families
SIAM Journal on Discrete Mathematics（2012）
摘要
Let G be a family of n-vertex graphs of uniform degree 2 with the property that the union of any two member graphs has degree four. We determine the leading term in the asymptotics of the largest cardinality of such a family. Several analogous problems are discussed.
更多查看译文
关键词
Hamilton cycles,maximum degree,pairwise graph union
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要